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 13:43Victor MerckléVictor MerckléScore: 4,423Success
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 13:464,39211,637,2493,865,00002,117,632stderr
2Jul 3, 2026 13:464,40111,659,5903,873,00002,117,632stderr
3Jul 3, 2026 13:464,40311,674,9353,875,00002,117,632stderr
4Jul 3, 2026 13:464,42011,670,4533,890,00002,117,632stderr
5Jul 3, 2026 13:464,42311,636,6243,893,00002,117,632stderr
6Jul 3, 2026 13:464,52311,980,3513,981,00002,117,632stderr
7Jul 3, 2026 13:464,52312,068,6613,981,00002,117,632stderr
8Jul 3, 2026 13:464,53812,043,3743,994,00002,117,632stderr
9Jul 3, 2026 13:464,54311,685,2713,998,00002,117,632stderr