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 2, 2026 19:38Victor MerckléVictor MerckléScore: 4,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 19:414,59611,785,8844,045,00002,117,632stderr
2Jul 2, 2026 19:414,70212,065,3234,138,00002,117,632stderr
3Jul 2, 2026 19:414,72111,854,8514,155,00002,117,632stderr
4Jul 2, 2026 19:414,72111,834,9624,155,00002,117,632stderr
5Jul 2, 2026 19:414,72312,215,0264,157,00002,117,632stderr
6Jul 2, 2026 19:414,73711,837,0104,169,00002,117,632stderr
7Jul 2, 2026 19:414,73811,806,3394,170,00002,117,632stderr
8Jul 2, 2026 19:414,74011,909,0144,172,00002,117,632stderr
9Jul 2, 2026 19:414,98712,082,4024,389,00002,117,632stderr