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 listSep 2, 2026 02:12Victor MerckléVictor MerckléScore: 3,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 02:143,03810,878,8182,674,00002,117,632stderr
2Sep 2, 2026 02:143,04510,935,2922,680,00002,117,632stderr
3Sep 2, 2026 02:143,04510,919,6422,680,00002,117,632stderr
4Sep 2, 2026 02:143,05110,928,7142,685,00002,117,632stderr
5Sep 2, 2026 02:143,05210,874,8132,686,00002,117,632stderr
6Sep 2, 2026 02:143,06010,925,4962,693,00002,117,632stderr
7Sep 2, 2026 02:143,06910,912,0392,701,00002,117,632stderr
8Sep 2, 2026 02:143,14012,114,5022,764,00002,117,632stderr
9Sep 2, 2026 02:143,16510,979,9632,786,00002,117,632stderr