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 19, 2026 17:56Victor MerckléVictor MerckléScore: 6,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 17:596,93113,586,6126,100,00002,113,536
2Jun 19, 2026 17:596,93813,363,9826,106,00002,113,536
3Jun 19, 2026 17:596,94213,607,9536,109,00002,113,536
4Jun 19, 2026 17:596,96513,641,9376,130,00002,113,536
5Jun 19, 2026 17:596,96813,410,9666,132,00002,113,536
6Jun 19, 2026 17:597,02513,630,7336,182,00002,113,536
7Jun 19, 2026 17:597,02513,897,8726,182,00002,113,536
8Jun 19, 2026 17:597,13413,898,8006,278,00002,113,536
9Jun 19, 2026 17:597,13713,695,5406,281,00002,113,536