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 22, 2026 14:43Josu San MartinJosu San MartinScore: 6,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 14:466,31114,655,9405,554,00002,113,536
2Jun 22, 2026 14:466,33213,099,7525,573,00002,113,536
3Jun 22, 2026 14:466,36313,191,8645,600,00002,113,536
4Jun 22, 2026 14:466,40713,074,7885,639,00002,113,536
5Jun 22, 2026 14:466,41413,121,1985,645,00002,113,536
6Jun 22, 2026 14:466,41713,426,4245,647,00002,113,536
7Jun 22, 2026 14:466,44813,185,0555,675,00002,113,536
8Jun 22, 2026 14:466,45013,168,0075,676,00002,113,536
9Jun 22, 2026 14:466,61813,262,8825,824,00002,113,536