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 listJul 3, 2026 02:12Victor MerckléVictor MerckléScore: 4,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 02:154,41111,636,0503,882,00002,117,632stderr
2Jul 3, 2026 02:154,42111,684,6043,891,00002,117,632stderr
3Jul 3, 2026 02:154,43411,674,2213,902,00002,117,632stderr
4Jul 3, 2026 02:154,43811,690,1613,906,00002,117,632stderr
5Jul 3, 2026 02:154,45411,719,1333,920,00002,117,632stderr
6Jul 3, 2026 02:154,52711,646,8773,984,00002,117,632stderr
7Jul 3, 2026 02:154,56311,698,2584,016,00002,117,632stderr
8Jul 3, 2026 02:154,58611,731,6924,036,00002,117,632stderr
9Jul 3, 2026 02:155,05712,132,8054,451,00002,117,632stderr