michael@0: // The Great Computer Language Shootout
michael@0: //  http://shootout.alioth.debian.org
michael@0: //
michael@0: //  Contributed by Ian Osgood
michael@0: 
michael@0: function pad(n,width) {
michael@0:   var s = n.toString();
michael@0:   /* BEGIN LOOP */
michael@0:   while (s.length < width) s = ' ' + s;
michael@0:   /* END LOOP */
michael@0:   return s;
michael@0: }
michael@0: 
michael@0: function primes(isPrime, n) {
michael@0:   var i, count = 0, m = 10000<<n, size = m+31>>5;
michael@0: 
michael@0:   /* BEGIN LOOP */
michael@0:   for (i=0; i<size; i++) isPrime[i] = 0xffffffff;
michael@0:   /* END LOOP */
michael@0: 
michael@0:   /* BEGIN LOOP */
michael@0:   for (i=2; i<m; i++)
michael@0:     if (isPrime[i>>5] & 1<<(i&31)) {
michael@0:       /* BEGIN LOOP */
michael@0:       for (var j=i+i; j<m; j+=i)
michael@0:         isPrime[j>>5] &= ~(1<<(j&31));
michael@0:       /* END LOOP */
michael@0:       count++;
michael@0:     }
michael@0:   /* END LOOP */
michael@0: }
michael@0: 
michael@0: function sieve() {
michael@0:     /* BEGIN LOOP */
michael@0:     for (var i = 4; i <= 4; i++) {
michael@0:         var isPrime = new Array((10000<<i)+31>>5);
michael@0:         primes(isPrime, i);
michael@0:     }
michael@0:     /* END LOOP */
michael@0: }
michael@0: 
michael@0: sieve();