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 22, 2026 17:03M-RochatM-RochatScore: 23,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 17:0623,34531,586,63919,481,0001,063,0002,113,536
2May 22, 2026 17:0623,35029,839,41519,495,0001,053,0002,113,536
3May 22, 2026 17:0623,39530,309,87419,516,0001,072,0002,113,536
4May 22, 2026 17:0623,40232,908,43719,538,0001,056,0002,113,536
5May 22, 2026 17:0623,40234,081,95919,513,0001,081,0002,113,536
6May 22, 2026 17:0623,48429,890,54119,597,0001,069,0002,113,536
7May 22, 2026 17:0623,58529,980,89819,606,0001,149,0002,113,536
8May 22, 2026 17:0623,61231,323,60819,726,0001,053,0002,113,536
9May 22, 2026 17:0623,95332,679,61220,015,0001,064,0002,113,536