[Shootout-list] Re: Integer overflow

[Bengt Kleberg]

Isaac Gouy wrote:
...deleted
> Perhaps we have to bite-the-bullet and change existing code, so that we
> can keep the fastest run-time up-around 0.5s and keep the largest ints
> within range. Oh for a slower machine ;-)

we should always change the input (preferably only n) so that the 
fastest run time is x (i would have choosen 1 second), or as close to x 
as possible.
the too slow languages (300 seconds seems fair) gets a red cross in 
their column. it is what they deserve.


bengt