Hello,
I have some extra time at work and I'm trying to come up with a good prime number generator for very large numbers that can take advantage of multiple (hundreds) cores. I realize Perl may not be the best solution for this, any ideas?
Thanks!
A truly remarkable script to determine prime numbers in a given range is here: 128-Character Perl Prime Number Finder | Donnie Knows
On my system, the script takes about 1 minute to print 78498 prime numbers between 1 and 1 million.
$
$
$ time perl -wle 'print join("\n",grep{$_==2?1:$_<2||!($_%2)?0:do{for($b=1,$a=3;$a<sqrt$_+1;$a+=2){do{$b=0;last}if!($_%$a)}$b}}(shift..shift)),"\n"' 1 1000000
2
3
5
7
11
13
17
19
23
29
...
...
...
999769
999773
999809
999853
999863
999883
999907
999917
999931
999953
999959
999961
999979
999983
real 1m5.324s
user 0m49.537s
sys 0m0.340s
$
$
HTH,
tyler_durden