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 22, 2026 18:47M-RochatM-RochatScore: 22,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 18:4922,56432,034,86518,790,0001,067,0002,113,536
2May 22, 2026 18:4922,59630,362,13818,828,0001,057,0002,113,536
3May 22, 2026 18:4922,64230,487,50218,861,0001,064,0002,113,536
4May 22, 2026 18:4922,71032,339,90518,919,0001,066,0002,113,536
5May 22, 2026 18:4922,72032,281,97718,836,0001,158,0002,113,536
6May 22, 2026 18:4922,73530,339,33918,939,0001,068,0002,113,536
7May 22, 2026 18:4922,76031,185,71419,001,0001,028,0002,113,536
8May 22, 2026 18:4922,82731,422,53119,057,0001,031,0002,113,536
9May 22, 2026 18:4922,90530,422,41218,987,0001,170,0002,113,536