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 5, 2026 00:41Victor MerckléVictor MerckléScore: 4,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 00:444,32511,730,8983,806,00002,117,632stderr
2Jul 5, 2026 00:444,41411,778,9553,885,00002,117,632stderr
3Jul 5, 2026 00:444,42811,710,7853,897,00002,117,632stderr
4Jul 5, 2026 00:444,43011,668,2363,899,00002,117,632stderr
5Jul 5, 2026 00:444,43111,773,3143,900,00002,117,632stderr
6Jul 5, 2026 00:444,43511,730,4713,903,00002,117,632stderr
7Jul 5, 2026 00:444,54311,818,7373,998,00002,117,632stderr
8Jul 5, 2026 00:444,54811,760,5044,003,00002,117,632stderr
9Jul 5, 2026 00:444,55411,769,3914,008,00002,117,632stderr