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 12:54Victor MerckléVictor MerckléScore: 3,048Success
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 12:573,03810,922,4352,674,00002,117,632stderr
2Sep 2, 2026 12:573,03910,958,7002,675,00002,117,632stderr
3Sep 2, 2026 12:573,04410,859,5282,679,00002,117,632stderr
4Sep 2, 2026 12:573,04810,897,2272,683,00002,117,632stderr
5Sep 2, 2026 12:573,04810,921,3102,683,00002,117,632stderr
6Sep 2, 2026 12:573,06110,902,9472,694,00002,117,632stderr
7Sep 2, 2026 12:573,14511,551,9472,768,00002,117,632stderr
8Sep 2, 2026 12:573,14811,538,4122,771,00002,117,632stderr
9Sep 2, 2026 12:573,21418,480,5762,829,00002,117,632stderr