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 5, 2026 23:11vahookvahookScore: 3,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 23:113,45117,759,1221,012,0002,025,0002,535,424
2Feb 5, 2026 23:113,45321,817,5941,013,0002,026,0002,498,560
3Feb 5, 2026 23:113,45718,288,8011,014,0002,028,0002,281,472
4Feb 5, 2026 23:113,46018,916,2541,015,0002,030,0002,502,656
5Feb 5, 2026 23:113,47020,462,3161,018,0002,036,0002,281,472
6Feb 5, 2026 23:113,47518,406,7671,019,0002,039,0002,502,656
7Feb 5, 2026 23:113,47717,538,6321,020,0002,040,0002,281,472
8Feb 5, 2026 23:113,48524,412,6011,022,0002,045,0002,502,656
9Feb 5, 2026 23:113,49124,544,6911,024,0002,048,0002,498,560