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 05:31Josu San MartinJosu San MartinScore: 5,139Success
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 05:345,04311,922,2104,438,00002,113,536
2Jun 23, 2026 05:345,04411,922,5694,439,00002,113,536
3Jun 23, 2026 05:345,05311,975,8044,447,00002,113,536
4Jun 23, 2026 05:345,08411,984,2094,474,00002,113,536
5Jun 23, 2026 05:345,13913,450,7624,523,00002,113,536
6Jun 23, 2026 05:345,14711,998,1964,530,00002,113,536
7Jun 23, 2026 05:345,15511,945,0424,537,00002,113,536
8Jun 23, 2026 05:345,17312,315,8054,553,00002,113,536
9Jun 23, 2026 05:345,17311,938,7254,553,00002,113,536