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 15:35Victor MerckléVictor MerckléScore: 4,535Success
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 15:384,42311,711,4543,893,00002,117,632stderr
2Jul 5, 2026 15:384,43511,755,2673,903,00002,117,632stderr
3Jul 5, 2026 15:384,49011,790,2143,952,00002,117,632stderr
4Jul 5, 2026 15:384,53411,769,5483,990,00002,117,632stderr
5Jul 5, 2026 15:384,53511,760,8583,991,00002,117,632stderr
6Jul 5, 2026 15:384,53612,125,5493,992,00002,117,632stderr
7Jul 5, 2026 15:384,65512,276,8254,097,00002,117,632stderr
8Jul 5, 2026 15:384,65611,920,2984,098,00002,117,632stderr
9Jul 5, 2026 15:384,97112,252,6854,375,00002,117,632stderr