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 06:09Victor MerckléVictor MerckléScore: 5,939Success
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 06:125,82612,575,0665,127,00002,113,536
2Jun 23, 2026 06:125,86012,669,3645,157,00002,113,536
3Jun 23, 2026 06:125,89015,315,5995,184,00002,113,536
4Jun 23, 2026 06:125,92813,113,8005,217,00002,113,536
5Jun 23, 2026 06:125,93913,041,4905,227,00002,113,536
6Jun 23, 2026 06:125,95312,702,6145,239,00002,113,536
7Jun 23, 2026 06:125,97512,730,6915,258,00002,113,536
8Jun 23, 2026 06:125,99513,051,1505,276,00002,113,536
9Jun 23, 2026 06:126,16012,850,4285,421,00002,113,536