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 6, 2026 10:46Victor MerckléVictor MerckléScore: 3,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 10:523,89711,245,1163,430,00002,117,632stderr
2Jul 6, 2026 10:523,90211,270,2933,434,00002,117,632stderr
3Jul 6, 2026 10:523,91111,564,6343,442,00002,117,632stderr
4Jul 6, 2026 10:523,91211,258,1343,443,00002,117,632stderr
5Jul 6, 2026 10:523,91711,293,8173,447,00002,117,632stderr
6Jul 6, 2026 10:524,00511,278,4403,525,00002,117,632stderr
7Jul 6, 2026 10:524,01212,488,6373,531,00002,117,632stderr
8Jul 6, 2026 10:524,07211,378,2443,584,00002,117,632stderr
9Jul 6, 2026 10:524,08011,343,9793,591,00002,117,632stderr