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 22:23Josu San MartinJosu San MartinScore: 5,352Success
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 22:265,26912,175,3734,637,00002,113,536
2Jun 22, 2026 22:265,27212,125,7004,640,00002,113,536
3Jun 22, 2026 22:265,28512,193,6454,651,00002,113,536
4Jun 22, 2026 22:265,34312,166,4394,702,00002,113,536
5Jun 22, 2026 22:265,35212,347,8244,710,00002,113,536
6Jun 22, 2026 22:265,35512,101,1704,713,00002,113,536
7Jun 22, 2026 22:265,37012,551,1224,726,00002,113,536
8Jun 22, 2026 22:265,38212,611,9944,737,00002,113,536
9Jun 22, 2026 22:265,40512,558,4314,757,00002,113,536