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 06:31Victor MerckléVictor MerckléScore: 9,545Success
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 06:349,45615,819,9228,322,00002,113,536
2Jun 6, 2026 06:349,51115,801,4738,370,00002,113,536
3Jun 6, 2026 06:349,51115,826,1768,370,00002,113,536
4Jun 6, 2026 06:349,53015,844,6558,387,00002,113,536
5Jun 6, 2026 06:349,54515,899,2068,400,00002,113,536
6Jun 6, 2026 06:349,54815,860,9498,403,00002,113,536
7Jun 6, 2026 06:349,56815,832,8178,420,00002,113,536
8Jun 6, 2026 06:349,57815,907,6638,429,00002,113,536
9Jun 6, 2026 06:349,58615,879,9168,436,00002,113,536