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 01:52Victor MerckléVictor MerckléScore: 4,521Success
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 01:544,41811,739,4753,888,00002,117,632stderr
2Jul 5, 2026 01:544,42211,684,9883,892,00002,117,632stderr
3Jul 5, 2026 01:544,43411,712,5283,902,00002,117,632stderr
4Jul 5, 2026 01:544,46111,763,0593,926,00002,117,632stderr
5Jul 5, 2026 01:544,52111,785,9053,979,00002,117,632stderr
6Jul 5, 2026 01:544,52212,061,2133,980,00002,117,632stderr
7Jul 5, 2026 01:544,52611,818,5393,983,00002,117,632stderr
8Jul 5, 2026 01:544,53212,032,0603,989,00002,117,632stderr
9Jul 5, 2026 01:544,56711,740,8614,019,00002,117,632stderr