1 // The Great Computer Language Shootout
2 // http://shootout.alioth.debian.org
4 // Contributed by Ian Osgood
8 function pad(n,width) {
10 while (s.length < width) s = ' ' + s;
14 function primes(isPrime, n) {
15 var i, count = 0, m = 10000<<n, size = m+31>>5;
17 for (i=0; i<size; i++) isPrime[i] = 0xffffffff;
20 if (isPrime[i>>5] & 1<<(i&31)) {
21 for (var j=i+i; j<m; j+=i)
22 result.push(isPrime[j>>5] &= ~(1<<(j&31)));
28 for (var i = 4; i <= 4; i++) {
29 var isPrime = new Array((10000<<i)+31>>5);
37 for (var i = 0; i < result.length; ++i)
40 assertEq(ret, -211235557404919)