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 08:36Victor MerckléVictor MerckléScore: 3,964Success
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 08:413,85711,224,5493,395,00002,117,632stderr
2Jul 6, 2026 08:413,91011,295,7703,441,00002,117,632stderr
3Jul 6, 2026 08:413,93911,242,1343,467,00002,117,632stderr
4Jul 6, 2026 08:413,95611,236,9183,482,00002,117,632stderr
5Jul 6, 2026 08:413,96411,272,2883,489,00002,117,632stderr
6Jul 6, 2026 08:413,98011,270,2963,503,00002,117,632stderr
7Jul 6, 2026 08:414,01111,416,3213,530,00002,117,632stderr
8Jul 6, 2026 08:414,01211,352,1093,531,00002,117,632stderr
9Jul 6, 2026 08:414,03211,353,7753,549,00002,117,632stderr