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 16:01M-RochatM-RochatScore: 46,544Success
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 16:0846,28450,976,42639,597,0001,133,0002,113,536
2May 16, 2026 16:0846,32249,349,11239,642,0001,122,0002,113,536
3May 16, 2026 16:0846,42051,490,71939,735,0001,115,0002,113,536
4May 16, 2026 16:0846,45749,417,11039,741,0001,142,0002,113,536
5May 16, 2026 16:0846,54450,648,35239,841,0001,118,0002,113,536
6May 16, 2026 16:0846,57549,534,51639,965,0001,021,0002,113,536
7May 16, 2026 16:0846,57949,898,31739,843,0001,147,0002,113,536
8May 16, 2026 16:0846,66749,669,15839,922,0001,145,0002,113,536
9May 16, 2026 16:0846,67949,835,21139,935,0001,143,0002,113,536