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 21, 2026 20:04M-RochatM-RochatScore: 23,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 20:0723,56931,961,25619,677,0001,064,0002,113,536
2May 21, 2026 20:0723,59831,051,80919,701,0001,066,0002,113,536
3May 21, 2026 20:0723,60232,461,01719,703,0001,067,0002,113,536
4May 21, 2026 20:0723,63235,158,12519,736,0001,061,0002,113,536
5May 21, 2026 20:0723,64231,868,53919,772,0001,033,0002,113,536
6May 21, 2026 20:0723,68432,538,54919,815,0001,027,0002,113,536
7May 21, 2026 20:0723,76030,314,04719,864,0001,045,0002,113,536
8May 21, 2026 20:0723,80431,338,52719,920,0001,028,0002,113,536
9May 21, 2026 20:0723,98233,416,62120,016,0001,089,0002,113,536