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 21, 2026 12:38Victor MerckléVictor MerckléScore: 6,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 12:416,82913,487,3456,010,00002,113,536
2Jun 21, 2026 12:416,85713,539,0476,035,00002,113,536
3Jun 21, 2026 12:416,86913,513,3726,045,00002,113,536
4Jun 21, 2026 12:416,91813,548,2476,088,00002,113,536
5Jun 21, 2026 12:416,95913,574,0116,124,00002,113,536
6Jun 21, 2026 12:416,96313,614,7096,128,00002,113,536
7Jun 21, 2026 12:417,06514,062,4106,218,00002,113,536
8Jun 21, 2026 12:417,07913,692,0056,230,00002,113,536
9Jun 21, 2026 12:417,27613,990,2506,403,00002,113,536