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 03:55Victor MerckléVictor MerckléScore: 4,721Success
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 03:584,59511,805,7814,044,00002,117,632stderr
2Jul 1, 2026 03:584,60611,833,6374,054,00002,117,632stderr
3Jul 1, 2026 03:584,61411,779,8574,061,00002,117,632stderr
4Jul 1, 2026 03:584,71911,798,0404,153,00002,117,632stderr
5Jul 1, 2026 03:584,72111,867,4454,155,00002,117,632stderr
6Jul 1, 2026 03:584,72511,822,8534,158,00002,117,632stderr
7Jul 1, 2026 03:584,73111,835,2914,164,00002,117,632stderr
8Jul 1, 2026 03:584,73211,852,5164,165,00002,117,632stderr
9Jul 1, 2026 03:585,20312,269,1614,579,00002,117,632stderr