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 17, 2026 00:10M-RochatM-RochatScore: 31,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 00:1231,05135,927,68426,197,0001,128,0002,113,536
2May 17, 2026 00:1231,06135,962,06426,211,0001,123,0002,113,536
3May 17, 2026 00:1231,06936,807,26126,307,0001,034,0002,113,536
4May 17, 2026 00:1231,08538,536,04526,214,0001,141,0002,113,536
5May 17, 2026 00:1231,15536,127,25126,274,0001,143,0002,113,536
6May 17, 2026 00:1231,19436,189,92126,327,0001,124,0002,113,536
7May 17, 2026 00:1231,24437,849,41126,348,0001,147,0002,113,536
8May 17, 2026 00:1231,25139,091,31026,468,0001,033,0002,113,536
9May 17, 2026 00:1231,35137,848,36426,557,0001,032,0002,113,536