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 4, 2026 08:06Victor MerckléVictor MerckléScore: 4,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 08:094,59711,887,6244,046,00002,117,632stderr
2Jul 4, 2026 08:094,60011,852,8534,048,00002,117,632stderr
3Jul 4, 2026 08:094,60512,320,6124,053,00002,117,632stderr
4Jul 4, 2026 08:094,68911,912,7124,127,00002,117,632stderr
5Jul 4, 2026 08:094,70311,878,7184,139,00002,117,632stderr
6Jul 4, 2026 08:094,70511,871,3834,141,00002,117,632stderr
7Jul 4, 2026 08:094,71211,962,1544,147,00002,117,632stderr
8Jul 4, 2026 08:094,72311,927,0244,157,00002,117,632stderr
9Jul 4, 2026 08:094,74212,305,6724,173,00002,117,632stderr