CalmoSoft primes: Difference between revisions
→{{header|Go}}: Updated in line with Wren version, about 20% faster.
(→{{header|Wren}}: Incorporates two optimizations (see Talk Page) - about 20% faster than before.) |
(→{{header|Go}}: Updated in line with Wren version, about 20% faster.) |
||
Line 609:
import (
"fmt"
"math/big"
"rcu"
"time"
Line 643 ⟶ 644:
sum -= primes[i-1]
}
isEven := i == 0
sum2 := sum
for j := pc - 1; j >= i; j-- {
Line 652 ⟶ 654:
sum2 -= primes[j+1]
}
if
continue
}
bsum := big.NewInt(int64(sum2))
if bsum.ProbablyPrime(5) {
if temp > longest {
longest = temp
Line 726 ⟶ 732:
7 + 11 + 13 + 17 + 19 + 23 + .. + 49999699 + 49999711 + 49999739 + 49999751 + 49999753 + 49999757 = 72,618,848,632,313
Took
</pre>
| |||