Re: [Chicken-users] big prime number

On Mon, Jan 25, 2016 at 03:00:46PM +0100, Peter Bex wrote: > Unfortunately, I just found out that something goes wrong when compiling > a program containing bignum literals: The number data can get truncated, > causing it to go from 22M to 2.1M which of course can be printed much > quicker. So we

Re: [Chicken-users] big prime number

On Mon, Jan 25, 2016 at 09:11:40AM +0100, Kristian Lein-Mathisen wrote: > Yes, indeed! CHICKEN 5 is exciting :) Thanks again Peter, for your ongoing > efforts in pushing this forward! Unfortunately, I just found out that something goes wrong when compiling a program containing bignum literals:

Re: [Chicken-users] big prime number

Yes, indeed! CHICKEN 5 is exciting :) Thanks again Peter, for your ongoing efforts in pushing this forward! K. On Mon, Jan 25, 2016 at 1:49 AM, Dan Leslie wrote: > > Peter Bex writes: > > > Now, the good news is that I also ran the program under

Re: [Chicken-users] big prime number

Peter Bex writes: > Now, the good news is that I also ran the program under CHICKEN 5 and > it took just under 17 seconds to complete. Most likely this is because > the whole thing can be done completely inline, without any CPS calls, > which means a lot less allocation,

Re: [Chicken-users] big prime number

On Sun, Jan 24, 2016 at 03:25:04PM -0500, Claude Marinier wrote: > Bonjour, Hello Claude, > Here is the program (minus timing code). > > (use numbers) > (define big-prime (- (expt 2 74207281) 1)) > (define big-print-str (number->string big-prime)) > (define outport (open-output-file

[Chicken-users] big prime number

Bonjour, Spurred by the recent excitement about a new largest prime number (1), I wanted to see how long it would take to just write the number. So I wrote a simple program and added timing to produce the following. claude@hibou:~/Programming/scheme$ ./big-prime time to compute big prime : 1.074