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:14Victor MerckléVictor MerckléScore: 6,970Success
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:176,85513,536,5946,033,00002,113,536
2Jun 19, 2026 19:176,86714,260,4626,043,00002,113,536
3Jun 19, 2026 19:176,91313,552,0726,084,00002,113,536
4Jun 19, 2026 19:176,93113,555,5986,100,00002,113,536
5Jun 19, 2026 19:176,97013,550,3826,134,00002,113,536
6Jun 19, 2026 19:177,15013,808,1646,292,00002,113,536
7Jun 19, 2026 19:177,25313,829,2006,383,00002,113,536
8Jun 19, 2026 19:177,29213,822,0166,417,00002,113,536
9Jun 19, 2026 19:177,31214,085,1496,435,00002,113,536