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 19:42M-RochatM-RochatScore: 23,609Success
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 19:4523,51931,535,17419,616,0001,081,0002,113,536
2May 21, 2026 19:4523,54030,321,91019,646,0001,070,0002,113,536
3May 21, 2026 19:4523,54630,951,60719,645,0001,076,0002,113,536
4May 21, 2026 19:4523,56831,223,94519,672,0001,068,0002,113,536
5May 21, 2026 19:4523,60931,133,80719,711,0001,065,0002,113,536
6May 21, 2026 19:4523,64232,221,67819,739,0001,066,0002,113,536
7May 21, 2026 19:4523,72031,646,30119,720,0001,154,0002,113,536
8May 21, 2026 19:4523,79431,757,05419,913,0001,026,0002,113,536
9May 21, 2026 19:4523,97033,141,15320,026,0001,068,0002,113,536