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 04:48Josu San MartinJosu San MartinScore: 5,172Success
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 04:515,10912,847,5054,496,00002,113,536
2Jun 23, 2026 04:515,16312,025,3124,544,00002,113,536
3Jun 23, 2026 04:515,16711,997,5984,547,00002,113,536
4Jun 23, 2026 04:515,17011,977,4474,550,00002,113,536
5Jun 23, 2026 04:515,17212,018,8254,552,00002,113,536
6Jun 23, 2026 04:515,17912,360,3304,558,00002,113,536
7Jun 23, 2026 04:515,18512,038,7474,563,00002,113,536
8Jun 23, 2026 04:515,18812,428,1344,566,00002,113,536
9Jun 23, 2026 04:515,19812,052,7444,575,00002,113,536