For the bitwise AND to be greater than zero, at least one bit should be 1 for every number in the combination.

The candidates are 24 bits long, so for every bit position, we can calculate the size of the largest combination such that the bitwise AND will have a 1 at that bit position.