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 22:32Victor MerckléVictor MerckléScore: 4,412Success
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 22:354,28711,582,0503,773,00002,117,632stderr
2Jul 5, 2026 22:354,29211,665,2443,777,00002,117,632stderr
3Jul 5, 2026 22:354,30211,576,4783,786,00002,117,632stderr
4Jul 5, 2026 22:354,41111,587,5273,882,00002,117,632stderr
5Jul 5, 2026 22:354,41211,637,6043,883,00002,117,632stderr
6Jul 5, 2026 22:354,41411,633,5403,885,00002,117,632stderr
7Jul 5, 2026 22:354,42811,617,2123,897,00002,117,632stderr
8Jul 5, 2026 22:354,44311,652,5793,910,00002,117,632stderr
9Jul 5, 2026 22:354,44812,425,1923,915,00002,117,632stderr