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:22Josu San MartinJosu San MartinScore: 5,181Success
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:255,08711,927,5654,477,00002,113,536
2Jun 23, 2026 06:255,09711,981,5214,486,00002,113,536
3Jun 23, 2026 06:255,16812,008,3794,548,00002,113,536
4Jun 23, 2026 06:255,16911,985,2134,549,00002,113,536
5Jun 23, 2026 06:255,18112,338,9064,560,00002,113,536
6Jun 23, 2026 06:255,19612,416,0244,573,00002,113,536
7Jun 23, 2026 06:255,21313,655,9994,588,00002,113,536
8Jun 23, 2026 06:255,57812,480,2354,909,00002,113,536
9Jun 23, 2026 06:255,58012,363,1234,911,00002,113,536