Bit wise And of number range !! 3 line simple solution .

You're doing too many & operations which can be time consuming. You can iteratively reduce the range [m,n] be noting that if mn>=2, then there must be an even number in the range and you can shift both m,n right by 1 bit. At the end you only have to do 1 & operation. Be sure to shift the result left by the number of times you reduce the range.

@hengliu Since when are & operations slow? And how many & operations do you think this is doing?