Estimated difficulty: 10

The solution is of course a simple dictionary lookup, and keeping count of the number of correct and incorrect translations. In case there is only one do another pass to find the solution.

Potential problems:
- Linear search trough the whole dictionary (you can just keep only the words that are only in $s$ and then linearly search)
- Integer overflow (numbers can be as big as 2^60, well that is convenient ;-) )
- Linearly generate all solutions
