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 15:30Victor MerckléVictor MerckléScore: 4,715Success
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 15:324,58111,770,6604,032,00002,113,536
2Jun 29, 2026 15:324,59011,775,6464,040,00002,113,536
3Jun 29, 2026 15:324,70412,145,8674,140,00002,113,536
4Jun 29, 2026 15:324,70911,765,9524,144,00002,113,536
5Jun 29, 2026 15:324,71511,818,6854,150,00002,113,536
6Jun 29, 2026 15:324,71511,814,8124,150,00002,113,536
7Jun 29, 2026 15:324,73912,109,7134,171,00002,113,536
8Jun 29, 2026 15:324,76711,938,4194,195,00002,113,536
9Jun 29, 2026 15:324,78711,836,2094,213,00002,113,536