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 11:44Victor MerckléVictor MerckléScore: 6,804Success
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 11:466,68113,712,9125,880,00002,117,632stderr
2Jul 2, 2026 11:466,70213,709,8675,898,00002,117,632stderr
3Jul 2, 2026 11:466,72113,690,3245,915,00002,117,632stderr
4Jul 2, 2026 11:466,79413,654,1785,979,00002,117,632stderr
5Jul 2, 2026 11:466,80413,707,8305,988,00002,117,632stderr
6Jul 2, 2026 11:466,80413,708,4535,988,00002,117,632stderr
7Jul 2, 2026 11:466,81313,998,6685,996,00002,117,632stderr
8Jul 2, 2026 11:466,91813,945,4896,088,00002,117,632stderr
9Jul 2, 2026 11:467,22114,076,2956,355,00002,117,632stderr