Problem 108. Given an unsigned integer x, find the largest y by rearranging the bits in x

Given an unsigned integer x, find the largest y by rearranging the bits in x.

Example:

 Input  x = 10
 Output y is 12

since 10 in binary is 1010 and 12 in binary is 1100.