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 1, 2026 04:23Victor MerckléVictor MerckléScore: 3,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 04:273,90611,725,1442,251,0001,187,0002,146,304stderr
2Sep 1, 2026 04:273,92111,808,3422,293,0001,158,0002,146,304stderr
3Sep 1, 2026 04:273,92213,244,4612,041,0001,411,0002,146,304stderr
4Sep 1, 2026 04:273,94311,804,7542,387,0001,083,0002,146,304stderr
5Sep 1, 2026 04:273,96411,847,6272,039,0001,450,0002,146,304stderr
6Sep 1, 2026 04:274,04411,732,9982,395,0001,164,0002,146,304stderr
7Sep 1, 2026 04:274,05511,597,1282,183,0001,386,0002,146,304stderr
8Sep 1, 2026 04:274,06311,847,8821,912,0001,664,0002,146,304stderr
9Sep 1, 2026 04:274,06511,738,5562,010,0001,568,0002,146,304stderr