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 listJun 6, 2026 07:55Victor MerckléVictor MerckléScore: 8,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 07:578,76115,172,9757,710,00002,113,536
2Jun 6, 2026 07:578,77215,096,9417,720,00002,113,536
3Jun 6, 2026 07:578,79415,178,4767,739,00002,113,536
4Jun 6, 2026 07:578,81515,150,4937,758,00002,113,536
5Jun 6, 2026 07:578,83815,126,0137,778,00002,113,536
6Jun 6, 2026 07:578,86015,176,6607,797,00002,113,536
7Jun 6, 2026 07:578,90515,351,4557,837,00002,113,536
8Jun 6, 2026 07:578,95915,493,1917,884,00002,113,536
9Jun 6, 2026 07:578,99015,386,8157,912,00002,113,536