[PROG CHALLENGE #024] Non-Corporate Edition

Write a function:

int solution(int N);

that, given a positive integer N, returns the length of its longest binary gap. The function should return 0 if N doesn't contain a binary gap.

For example, given N = 1041 the function should return 5, because N has binary representation 10000010001 and so its longest binary gap is of length 5. Given N = 32 the function should return 0, because N has binary representation '100000' and thus no binary gaps.

>>45

3.calculating int_max binary gaps each time the program starts negates any performance benefits.

Nonsense, it's simply trading space complexity and initial compute time to get O(1) on reads. This approach is pretty common in large scale distributed programming.

4.hardware with less than 8GB will either swap to disk or crash.

It's not 1970 and memory doesn't cost an arm and a leg anymore.

If you still don't believe memory lookup tables can be used for performance please see http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetTable and/or a modern project like Apache Spark.