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 10:34Victor MerckléVictor MerckléScore: 4,530Success
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 10:374,40711,703,7353,879,00002,117,632stderr
2Jul 3, 2026 10:374,41211,700,6793,883,00002,117,632stderr
3Jul 3, 2026 10:374,41811,663,3183,888,00002,117,632stderr
4Jul 3, 2026 10:374,51211,709,7633,971,00002,117,632stderr
5Jul 3, 2026 10:374,53012,085,9203,987,00002,117,632stderr
6Jul 3, 2026 10:374,53511,764,5673,991,00002,117,632stderr
7Jul 3, 2026 10:374,54812,014,8914,003,00002,117,632stderr
8Jul 3, 2026 10:374,55111,728,8464,005,00002,117,632stderr
9Jul 3, 2026 10:375,09012,198,6064,480,00002,117,632stderr