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 1, 2026 17:55Victor MerckléVictor MerckléScore: 4,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 17:584,56914,835,8804,021,00002,117,632stderr
2Jul 1, 2026 17:584,62711,871,9064,072,00002,117,632stderr
3Jul 1, 2026 17:584,62911,856,3544,074,00002,117,632stderr
4Jul 1, 2026 17:584,63411,840,2164,078,00002,117,632stderr
5Jul 1, 2026 17:584,72811,894,5774,161,00002,117,632stderr
6Jul 1, 2026 17:584,74411,864,7544,175,00002,117,632stderr
7Jul 1, 2026 17:584,86312,079,0874,280,00002,117,632stderr
8Jul 1, 2026 17:584,90311,943,7674,315,00002,117,632stderr
9Jul 1, 2026 17:585,12712,256,3644,512,00002,117,632stderr