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 23:00Victor MerckléVictor MerckléScore: 129,978Success
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 23:03129,523121,609,398113,981,00002,117,632stderr
2Jul 3, 2026 23:03129,588123,242,094114,038,00002,117,632stderr
3Jul 3, 2026 23:03129,872121,998,318114,288,00002,117,632stderr
4Jul 3, 2026 23:03129,917122,045,672114,327,00002,117,632stderr
5Jul 3, 2026 23:03129,978122,098,988114,381,00002,117,632stderr
6Jul 3, 2026 23:03130,023122,033,070114,421,00002,117,632stderr
7Jul 3, 2026 23:03130,107122,113,860114,495,00002,117,632stderr
8Jul 3, 2026 23:03130,242122,211,772114,613,00002,117,632stderr
9Jul 3, 2026 23:03130,245122,257,136114,616,00002,117,632stderr