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 listMay 16, 2026 20:47M-RochatM-RochatScore: 51,392Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 20:5151,33455,075,93245,174,00002,113,536
2May 16, 2026 20:5151,35456,700,20145,192,00002,113,536
3May 16, 2026 20:5151,37053,798,31345,206,00002,113,536
4May 16, 2026 20:5151,37955,794,49545,214,00002,113,536
5May 16, 2026 20:5151,39255,491,11945,225,00002,113,536
6May 16, 2026 20:5151,46054,824,96845,285,00002,113,536
7May 16, 2026 20:5151,46754,190,54545,291,00002,113,536
8May 16, 2026 20:5151,50356,890,46545,323,00002,113,536
9May 16, 2026 20:5151,53553,905,50245,351,00002,113,536