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 19:39Victor 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 19:416,90213,558,2546,074,00002,113,536
2Jun 19, 2026 19:416,94813,528,1406,115,00002,113,536
3Jun 19, 2026 19:416,96413,557,8286,129,00002,113,536
4Jun 19, 2026 19:416,96713,691,5796,131,00002,113,536
5Jun 19, 2026 19:416,96813,586,3016,132,00002,113,536
6Jun 19, 2026 19:416,96913,531,2266,133,00002,113,536
7Jun 19, 2026 19:416,97715,053,6486,140,00002,113,536
8Jun 19, 2026 19:416,98113,594,4006,144,00002,113,536
9Jun 19, 2026 19:417,02913,632,3006,186,00002,113,536