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 23, 2026 03:17Victor MerckléVictor MerckléScore: 6,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 03:196,48913,234,2735,711,00002,113,536
2Jun 23, 2026 03:196,59213,572,3275,801,00002,113,536
3Jun 23, 2026 03:196,59813,253,1405,807,00002,113,536
4Jun 23, 2026 03:196,61313,558,4065,820,00002,113,536
5Jun 23, 2026 03:196,61913,615,0075,825,00002,113,536
6Jun 23, 2026 03:196,63713,312,5375,841,00002,113,536
7Jun 23, 2026 03:196,69313,429,2235,890,00002,113,536
8Jun 23, 2026 03:196,77113,402,0385,959,00002,113,536
9Jun 23, 2026 03:196,81513,795,1985,998,00002,113,536