Added a failing test for reversed binary numbers.
Simplest possible implementation.
Added a failing test.
Again. The simplest possible implementation.
Added another test. Slightly more interesting.
Added a binary function and a failing test for it.

Since I won't be able to implement solve without going through
a number of different steps I'll break the implementation
apart so that I can cover it all with tests.
Added an implementation for binary.

Note that the built-in 'bin' function return binary numbers
as a string '0bNN..NN' which is why I have to strip the first
two chars off it.
Another test for binary. The implementation looks like it'll hold.
Added another method for the reverse binary and a failing test.
Added an implementation for reversed_binary.

Since the built-in 'reversed' function returns an iterator we
must loop through it to get at the values.
Added another test for reverse_bin.
Added an implementation for solve.

Now we can use the reverse_bin function to produce the final
result. We need to put back the '0b' that we take away in
the 'binary' function. Once we've got that in place we can
convert it back into a decimal with the built-in 'int'.
Refactoring.

Ok. Turns out we don't need the leading '0b' after all. So I
took it away. Also, I collapsed the binary method into the
reverse_bin function.
Refactoring.

Took away also the reverse_bin function to have everything
in a hard-to-read one-liner.
Added some more tests to the solve function.
Refactoring for readability.
Modifications for being run by the judge.
Fixed the input paremeter to the solve function when run by the judge.
Added a README for the puzzle.