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 16:55Josu San MartinJosu San MartinScore: 5,809Success
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 16:585,68912,538,8295,007,00002,113,536
2Jun 22, 2026 16:585,76912,535,8895,077,00002,113,536
3Jun 22, 2026 16:585,79312,646,1265,098,00002,113,536
4Jun 22, 2026 16:585,79512,557,5465,100,00002,113,536
5Jun 22, 2026 16:585,80912,546,2545,112,00002,113,536
6Jun 22, 2026 16:585,81112,630,6625,114,00002,113,536
7Jun 22, 2026 16:585,81312,594,6505,116,00002,113,536
8Jun 22, 2026 16:585,83012,933,4595,131,00002,113,536
9Jun 22, 2026 16:585,83112,639,7125,132,00002,113,536