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 17, 2026 00:26M-RochatM-RochatScore: 26,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 00:2826,11832,277,43121,852,0001,132,0002,113,536
2May 17, 2026 00:2826,14833,612,84121,876,0001,135,0002,113,536
3May 17, 2026 00:2826,17634,189,02121,997,0001,038,0002,113,536
4May 17, 2026 00:2826,18533,070,39321,917,0001,126,0002,113,536
5May 17, 2026 00:2826,20533,595,14821,921,0001,140,0002,113,536
6May 17, 2026 00:2826,22233,434,63921,939,0001,137,0002,113,536
7May 17, 2026 00:2826,23933,315,47322,060,0001,031,0002,113,536
8May 17, 2026 00:2826,35534,901,29322,033,0001,160,0002,113,536
9May 17, 2026 00:2826,37932,500,41122,180,0001,034,0002,113,536