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 listJul 5, 2026 22:27Victor MerckléVictor MerckléScore: 4,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 22:304,28411,629,1553,770,00002,117,632stderr
2Jul 5, 2026 22:304,31111,573,9453,794,00002,117,632stderr
3Jul 5, 2026 22:304,31911,668,2983,801,00002,117,632stderr
4Jul 5, 2026 22:304,33511,423,2573,815,00002,117,632stderr
5Jul 5, 2026 22:304,41311,944,3863,884,00002,117,632stderr
6Jul 5, 2026 22:304,46411,657,6903,929,00002,117,632stderr
7Jul 5, 2026 22:304,54011,789,1923,996,00002,117,632stderr
8Jul 5, 2026 22:304,61111,813,8454,058,00002,117,632stderr
9Jul 5, 2026 22:304,66711,911,2404,107,00002,117,632stderr