moodywoody has asked for the wisdom of the Perl Monks concerning the following question:
Dear Monks,
I was wondering whether there exist some general ideas of the performance impact when using bigint?
I was putting together some snippets for projecteuler.net (yes, I was bored and uninspired). The 14th problem asks for the length of Collatz chains http://projecteuler.net/problem=14. Anyhow, I wrote that http://pastebin.com/jbYBFiRZ up.
Or rather, at first I had one extra line at the top "use bigint;". Removing that line improved the performance from ~10min to 6sec or by factor 100.
Am I missing something or is bigint incredibly slow? Thank you for your insights.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re: bigint == horrible performance?
by syphilis (Archbishop) on Nov 06, 2011 at 01:43 UTC | |
Re: bigint == horrible performance?
by HAL9000 (Initiate) on Jun 12, 2017 at 04:50 UTC | |
Re: bigint == horrible performance?
by Khen1950fx (Canon) on Nov 06, 2011 at 10:05 UTC | |
by BrowserUk (Patriarch) on Nov 06, 2011 at 11:02 UTC | |
by mojotoad (Monsignor) on Nov 08, 2011 at 09:39 UTC | |
by BrowserUk (Patriarch) on Nov 08, 2011 at 15:38 UTC | |
by salva (Canon) on Nov 08, 2011 at 11:20 UTC | |
by syphilis (Archbishop) on Nov 08, 2011 at 12:03 UTC | |
by mojotoad (Monsignor) on Dec 13, 2011 at 08:15 UTC | |
| |
by moodywoody (Novice) on Nov 06, 2011 at 22:21 UTC | |
by BrowserUk (Patriarch) on Nov 07, 2011 at 15:04 UTC | |
by syphilis (Archbishop) on Nov 08, 2011 at 12:17 UTC | |
| |
by moodywoody (Novice) on Nov 08, 2011 at 11:01 UTC |
Back to
Seekers of Perl Wisdom