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 15:55Victor MerckléVictor MerckléScore: 4,942Success
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 15:574,82012,070,2824,242,00002,117,632stderr
2Jul 5, 2026 15:574,82712,041,3594,248,00002,117,632stderr
3Jul 5, 2026 15:574,86712,131,7934,283,00002,117,632stderr
4Jul 5, 2026 15:574,93512,255,1464,343,00002,117,632stderr
5Jul 5, 2026 15:574,94212,111,0134,349,00002,117,632stderr
6Jul 5, 2026 15:574,95412,369,7594,360,00002,117,632stderr
7Jul 5, 2026 15:574,96012,191,8894,365,00002,117,632stderr
8Jul 5, 2026 15:574,96712,573,0814,371,00002,117,632stderr
9Jul 5, 2026 15:574,97112,191,7414,375,00002,117,632stderr