This comment is hidden because it contains spoiler information about the solution
NASM translation and C translation
Haskell actually has arbitrary precision integers - limited only by resource limits. Those effectively have no upper bound. ( Your hardware is just inadequate. )
Obviously there can't be no upper limit as you can't provide 2 infinities as input and expect the user to compare them.
Never settle, right? ;-)
( JS, possibly others )
"There are no upper limits for A and B."
Good. But I then expect actual testing with numbers over 2**32, which means I'll have to arithmetic some other way than bitwise integer stuff.
Fixed testing is done with 32-bit numbers. Random testing is done with 16-bit numbers. These are upper limits.
Added in JS.
Added random tests to python and ruby. C# and Java already had them.
JS and CoffeScript is still lacking.
Re-ranked to 7 kyu
Was already done