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 30, 2026 00:18Victor MerckléVictor MerckléScore: 4,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 00:214,60011,732,3944,048,00002,117,632stderr
2Jun 30, 2026 00:214,61411,832,8124,061,00002,117,632stderr
3Jun 30, 2026 00:214,70611,906,9764,142,00002,117,632stderr
4Jun 30, 2026 00:214,72111,807,1884,155,00002,117,632stderr
5Jun 30, 2026 00:214,72311,793,0304,157,00002,117,632stderr
6Jun 30, 2026 00:214,73812,189,0644,170,00002,117,632stderr
7Jun 30, 2026 00:214,74612,079,1964,177,00002,117,632stderr
8Jun 30, 2026 00:214,75611,836,0084,186,00002,117,632stderr
9Jun 30, 2026 00:214,91411,984,8124,325,00002,117,632stderr