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 15:55Josu San MartinJosu San MartinScore: 5,857Success
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 15:585,73712,588,0245,049,00002,113,536
2Jun 22, 2026 15:585,74612,650,1415,057,00002,113,536
3Jun 22, 2026 15:585,76412,632,8465,073,00002,113,536
4Jun 22, 2026 15:585,84312,642,4795,142,00002,113,536
5Jun 22, 2026 15:585,85714,209,5645,155,00002,113,536
6Jun 22, 2026 15:585,87613,080,9015,171,00002,113,536
7Jun 22, 2026 15:585,88812,869,6145,182,00002,113,536
8Jun 22, 2026 15:585,96112,765,9915,246,00002,113,536
9Jun 22, 2026 15:586,04312,798,8855,318,00002,113,536