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 6, 2026 09:07Victor MerckléVictor MerckléScore: 7,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 09:107,70314,213,2806,779,00002,113,536
2Jun 6, 2026 09:107,73014,217,3496,803,00002,113,536
3Jun 6, 2026 09:107,73814,129,2696,810,00002,113,536
4Jun 6, 2026 09:107,81014,224,5646,873,00002,113,536
5Jun 6, 2026 09:107,81114,250,9246,874,00002,113,536
6Jun 6, 2026 09:107,81414,334,1546,877,00002,113,536
7Jun 6, 2026 09:107,82214,216,1786,884,00002,113,536
8Jun 6, 2026 09:107,83514,260,2916,895,00002,113,536
9Jun 6, 2026 09:107,93914,378,1376,987,00002,113,536