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 listFeb 6, 2026 21:25vahookvahookScore: 3,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 21:253,44818,519,9891,011,0002,023,0002,494,464
2Feb 6, 2026 21:253,45124,167,5451,012,0002,025,0002,490,368
3Feb 6, 2026 21:253,45324,598,7551,013,0002,026,0002,535,424
4Feb 6, 2026 21:253,45718,549,5881,014,0002,028,0002,502,656
5Feb 6, 2026 21:253,48421,265,2981,022,0002,044,0002,494,464
6Feb 6, 2026 21:253,65516,294,4981,072,0002,144,0002,494,464