[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.

>>24
Pull a PR request to owner to include Code tags in every post.
Alternatively develop a 3 line userscript or CSS style to manually set monospaced font and proper spacing/indent.
You could even autoformat each post with minimal overhead importing one of dozen text formatting frameworks as dependency of userscript.