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 listSep 3, 2026 12:57Victor MerckléVictor MerckléScore: 2,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 13:032,66010,554,1092,341,000024,576stderr
2Sep 3, 2026 13:032,66510,486,9012,346,000024,576stderr
3Sep 3, 2026 13:032,66710,477,2412,347,000024,576stderr
4Sep 3, 2026 13:032,67310,473,6202,353,000024,576stderr
5Sep 3, 2026 13:032,67510,585,1912,354,000024,576stderr
6Sep 3, 2026 13:032,67710,537,7532,356,000024,576stderr
7Sep 3, 2026 13:032,68210,604,6792,361,000024,576stderr
8Sep 3, 2026 13:032,68211,000,1652,361,000024,576stderr
9Sep 3, 2026 13:032,69411,940,5532,371,000024,576stderr