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:04M-RochatM-RochatScore: 49,457Success
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:1149,14351,974,78242,122,0001,124,0002,113,536
2May 16, 2026 16:1149,30551,931,28542,252,0001,137,0002,113,536
3May 16, 2026 16:1149,33652,713,25142,397,0001,019,0002,113,536
4May 16, 2026 16:1149,38752,794,40342,334,0001,127,0002,113,536
5May 16, 2026 16:1149,45752,115,92842,390,0001,133,0002,113,536
6May 16, 2026 16:1149,50952,079,87042,448,0001,120,0002,113,536
7May 16, 2026 16:1149,54853,265,79742,537,0001,066,0002,113,536
8May 16, 2026 16:1149,56952,238,22542,476,0001,145,0002,113,536
9May 16, 2026 16:1149,59452,262,63442,504,0001,139,0002,113,536