|Syntactic Confectionery Delight|
Re^2: bigint == horrible performance?by BrowserUk (Pope)
|on Nov 06, 2011 at 11:02 UTC||Need Help??|
It's not a hard problem to solve:
And the OP gave a link to his own 3 second solution, though I'm not sure why he pastebin'd it rather than posting it here.
The intriguing thing is why the OP felt the need for bigint in the first place given that using Perl's native scalars he could calculate this(*) for numbers up to 2,251,799,813,685,248 before running into precision problems.
(*)Assuming of course he had 400+ years and the exabytes of ram required to store the hash :)
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.