Function advent_solutions::advent2017::day15::part1

pub fn part1(((a_f, a_s), (b_f, b_s)): &((u32, u32), (u32, u32))) -> usize

Here, you can see that the lowest (here, rightmost) 16 bits of the third value match: 1110001101001010. Because of this one match, after processing these five pairs, the judge would have added only 1 to its total.

To get a significant sample, the judge would like to consider 40 million pairs. (In the example above, the judge would eventually find a total of 588 pairs that match in their lowest 16 bits.)

assert_eq!(part1(&((16807, 65), (48271, 8921))), 588);

After 40 million pairs, what is the judge's final count?