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 3, 2026 23:42Victor MerckléVictor MerckléScore: 4,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 23:454,39311,684,0843,866,00002,117,632stderr
2Jul 3, 2026 23:454,40411,710,9233,876,00002,117,632stderr
3Jul 3, 2026 23:454,53011,768,2853,987,00002,117,632stderr
4Jul 3, 2026 23:454,53011,690,8303,987,00002,117,632stderr
5Jul 3, 2026 23:454,53511,699,9173,991,00002,117,632stderr
6Jul 3, 2026 23:454,54412,125,9593,999,00002,117,632stderr
7Jul 3, 2026 23:454,67311,888,3984,113,00002,117,632stderr
8Jul 3, 2026 23:454,68611,867,0454,124,00002,117,632stderr
9Jul 3, 2026 23:454,75512,297,0964,185,00002,117,632stderr