Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister

Re^2: Triangle Numbers Revisited

by Limbic~Region (Chancellor)
on Oct 14, 2004 at 13:21 UTC ( #399197=note: print w/replies, xml ) Need Help??

in reply to Re: Triangle Numbers Revisited
in thread Triangle Numbers Revisited

Nice, but since you decided to cheat, I am going to make you pay for it (compile time). I changed the to 10_000 random targets ranging from 1 .. 999_999_999. My solution completed in 25 seconds while yours took a whopping 36 seconds. I realize you only pay the compiling penalty once unless you change the code or run it from a different directory, but hey - I had to level the playing field some how. Incidently, your code ran in 10 seconds the second time around and would still win with the compiling penalty if the number of targets was large enough. Good Job.

Cheers - L~R

Update: If you want to go up to a billion, you are going to need to change the C code. I thought I was doing really well until I realized what was going on.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://399197]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (8)
As of 2018-06-20 10:05 GMT
Find Nodes?
    Voting Booth?
    Should cpanminus be part of the standard Perl release?

    Results (116 votes). Check out past polls.