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 22, 2026 18:53M-RochatM-RochatScore: 22,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 18:5522,69429,535,68718,914,0001,057,0002,113,536
2May 22, 2026 18:5522,71129,800,13618,927,0001,059,0002,113,536
3May 22, 2026 18:5522,72630,942,73718,935,0001,064,0002,113,536
4May 22, 2026 18:5522,73931,058,34718,942,0001,069,0002,113,536
5May 22, 2026 18:5522,80732,032,66618,987,0001,084,0002,113,536
6May 22, 2026 18:5522,81730,439,61818,922,0001,157,0002,113,536
7May 22, 2026 18:5522,88132,574,03319,109,0001,027,0002,113,536
8May 22, 2026 18:5522,92130,739,45819,145,0001,026,0002,113,536
9May 22, 2026 18:5522,99031,597,31619,082,0001,150,0002,113,536