An interrogation routine is described which retrieves k multiple responses in, at best, (k+1) memory cycles and, at worst, (2k-1) memory cycles. In comparison, the fastest routine described in the literature, Lewin's routine5, always requires (2k-1) memory cycles. The reduction in number of memory cycles achieved by this interrogation routine is at the expense of some sophistication in the bit plane sensing device, namely, distinguishing between no signal, one unit of signal, and more than one unit of signal rather than distinguishing between absence and presence of signal. For large word lengths in respect to the average number of multiple responses, it is apparent that the best case will be expected.