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 3, 2026 13:22Victor MerckléVictor MerckléScore: 4,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 13:264,46811,708,5023,932,00002,117,632stderr
2Jul 3, 2026 13:264,47611,708,6033,939,00002,117,632stderr
3Jul 3, 2026 13:264,47911,703,2193,942,00002,117,632stderr
4Jul 3, 2026 13:264,48011,745,2193,943,00002,117,632stderr
5Jul 3, 2026 13:264,48211,723,9813,945,00002,117,632stderr
6Jul 3, 2026 13:264,50011,757,2233,960,00002,117,632stderr
7Jul 3, 2026 13:264,58711,756,0234,037,00002,117,632stderr
8Jul 3, 2026 13:264,60312,106,8744,051,00002,117,632stderr
9Jul 3, 2026 13:264,60911,746,5244,056,00002,117,632stderr