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 5, 2026 07:28Victor MerckléVictor MerckléScore: 4,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 07:314,40611,742,4643,878,00002,117,632stderr
2Jul 5, 2026 07:314,41011,727,6503,881,00002,117,632stderr
3Jul 5, 2026 07:314,43211,692,4503,901,00002,117,632stderr
4Jul 5, 2026 07:314,52311,778,9063,981,00002,117,632stderr
5Jul 5, 2026 07:314,52811,755,8503,985,00002,117,632stderr
6Jul 5, 2026 07:314,53011,748,8133,987,00002,117,632stderr
7Jul 5, 2026 07:314,53212,120,3793,989,00002,117,632stderr
8Jul 5, 2026 07:314,56211,821,1704,015,00002,117,632stderr
9Jul 5, 2026 07:314,57712,142,4134,028,00002,117,632stderr