Sum of prime numbers Andrey Tsvetkov

Compute the sum of all prime numbers in a stream of binary integers as fast as possible.

Input: 1 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of all values that are prime, printed as a decimal string.

Back to listMay 21, 2026 19:39M-RochatM-RochatScore: 23,668Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 19:4123,51532,386,55019,650,0001,044,0002,113,536
2May 21, 2026 19:4123,59033,240,79719,691,0001,069,0002,113,536
3May 21, 2026 19:4123,61830,320,42819,720,0001,064,0002,113,536
4May 21, 2026 19:4123,63631,932,21919,727,0001,073,0002,113,536
5May 21, 2026 19:4123,66832,090,62219,748,0001,080,0002,113,536
6May 21, 2026 19:4123,67230,081,53619,690,0001,142,0002,113,536
7May 21, 2026 19:4123,68431,841,72619,697,0001,145,0002,113,536
8May 21, 2026 19:4123,74533,028,63219,745,0001,151,0002,113,536
9May 21, 2026 19:4123,87732,888,07519,986,0001,026,0002,113,536