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 4, 2026 00:10vahookvahookScore: 3,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 4, 2026 00:103,87321,050,1592,272,0001,136,0002,498,560
2Feb 4, 2026 00:103,89716,545,7212,286,0001,143,0002,490,368
3Feb 4, 2026 00:103,89719,361,8702,286,0001,143,0002,502,656
4Feb 4, 2026 00:103,91417,563,7082,296,0001,148,0002,490,368
5Feb 4, 2026 00:103,91821,459,0442,299,0001,149,0002,498,560
6Feb 4, 2026 00:103,92218,342,8782,301,0001,150,0002,494,464
7Feb 4, 2026 00:103,92721,788,9882,304,0001,152,0002,277,376
8Feb 4, 2026 00:103,92721,613,0182,304,0001,152,0002,277,376
9Feb 4, 2026 00:103,92816,319,3692,305,0001,152,0002,498,560