Summary: A simple hard-thresholding operation is shown to be able to uniformly recover \(L\) signals \(\mathfrak{x}_1,\dots,\mathfrak{x}_L\in\mathbb{R}^n\) that share a common support of size \(s\) from \(m=O(s)\) one-bit measurements per signal if \(L\geqslant\ln (en/s)\). This result improves the single signal recovery bounds with \(m=O(s\ln (en/s))\) measurements in the sense that asymptotically fewer measurements per non-zero entry are needed. Numerical evidence supports the theoretical considerations.