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 1, 2026 16:41Pavel SkripkinPavel SkripkinScore: 38,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 16:4138,67751,209,99132,034,0002,002,0002,428,928
2May 1, 2026 16:4138,78148,682,48432,121,0002,007,0002,437,120
3May 1, 2026 16:4138,88250,807,31233,211,0001,006,0002,330,624
4May 1, 2026 16:4138,91150,749,72133,235,0001,007,0002,433,024
5May 1, 2026 16:4138,97847,405,65933,293,0001,008,0002,523,136
6May 1, 2026 16:4139,00046,282,68933,311,0001,009,0002,326,528
7May 1, 2026 16:4139,06153,652,63033,363,0001,011,0002,330,624
8May 1, 2026 16:4139,08151,371,83933,381,0001,011,0002,424,832
9May 1, 2026 16:4139,17950,983,25533,464,0001,014,0002,330,624