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 listJun 23, 2026 06:51Victor MerckléVictor MerckléScore: 6,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 06:535,88612,761,7065,180,00002,117,632stderr
2Jun 23, 2026 06:535,89412,678,5425,187,00002,117,632stderr
3Jun 23, 2026 06:535,91212,704,7825,203,00002,117,632stderr
4Jun 23, 2026 06:535,92512,728,5405,214,00002,117,632stderr
5Jun 23, 2026 06:536,01212,710,2285,291,00002,117,632stderr
6Jun 23, 2026 06:536,02313,162,5605,301,00002,117,632stderr
7Jun 23, 2026 06:536,03812,813,5835,314,00002,117,632stderr
8Jun 23, 2026 06:536,04013,142,5945,316,00002,117,632stderr
9Jun 23, 2026 06:536,07512,822,5085,346,00002,117,632stderr