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 2, 2026 12:54Victor MerckléVictor MerckléScore: 4,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:574,66011,840,1774,101,00002,117,632stderr
2Jul 2, 2026 12:574,68811,882,0564,126,00002,117,632stderr
3Jul 2, 2026 12:574,78811,919,4894,214,00002,117,632stderr
4Jul 2, 2026 12:574,80211,921,0284,226,00002,117,632stderr
5Jul 2, 2026 12:574,81511,987,2094,238,00002,117,632stderr
6Jul 2, 2026 12:574,81912,328,5394,241,00002,117,632stderr
7Jul 2, 2026 12:574,82312,324,8934,245,00002,117,632stderr
8Jul 2, 2026 12:574,89214,267,0414,305,00002,117,632stderr
9Jul 2, 2026 12:574,92512,077,2614,334,00002,117,632stderr