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 9, 2026 19:45Victor MerckléVictor MerckléScore: 8,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 19:518,88416,576,4156,616,0001,202,0002,138,112
2Jun 9, 2026 19:518,88616,554,1466,608,0001,212,0002,138,112
3Jun 9, 2026 19:518,90516,477,0946,618,0001,219,0002,134,016
4Jun 9, 2026 19:518,92516,612,1106,637,0001,217,0002,138,112
5Jun 9, 2026 19:518,93216,675,5336,651,0001,210,0002,138,112
6Jun 9, 2026 19:518,93816,474,9346,638,0001,228,0002,138,112
7Jun 9, 2026 19:519,19216,960,1616,828,0001,261,0002,138,112
8Jun 9, 2026 19:519,22316,873,9786,885,0001,232,0002,138,112
9Jun 9, 2026 19:519,23016,859,3646,866,0001,257,0002,138,112