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 29, 2026 16:17Victor MerckléVictor MerckléScore: 4,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 16:204,58811,764,8714,038,00002,113,536
2Jun 29, 2026 16:204,61911,765,9284,065,00002,113,536
3Jun 29, 2026 16:204,69611,881,3544,133,00002,113,536
4Jun 29, 2026 16:204,70211,998,1474,138,00002,113,536
5Jun 29, 2026 16:204,70412,074,8104,140,00002,113,536
6Jun 29, 2026 16:204,70911,829,9294,144,00002,113,536
7Jun 29, 2026 16:204,71412,089,5854,149,00002,113,536
8Jun 29, 2026 16:204,73412,122,5414,166,00002,113,536
9Jun 29, 2026 16:204,75512,138,4374,185,00002,113,536