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:01Victor MerckléVictor MerckléScore: 3,059Success
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:053,03510,933,8442,671,00002,117,632stderr
2Sep 2, 2026 02:053,03510,912,8872,671,00002,117,632stderr
3Sep 2, 2026 02:053,03910,932,5272,675,00002,117,632stderr
4Sep 2, 2026 02:053,04810,965,6702,683,00002,117,632stderr
5Sep 2, 2026 02:053,05910,948,2082,692,00002,117,632stderr
6Sep 2, 2026 02:053,06310,943,2702,696,00002,117,632stderr
7Sep 2, 2026 02:053,13710,935,7912,761,00002,117,632stderr
8Sep 2, 2026 02:053,14010,949,3752,764,00002,117,632stderr
9Sep 2, 2026 02:053,14511,006,5582,768,00002,117,632stderr