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 01:14vahookvahookScore: 3,523Success
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 01:143,48117,106,5281,021,0002,042,0002,498,560
2Feb 5, 2026 01:153,48218,542,5261,021,0002,043,0002,498,560
3Feb 5, 2026 01:153,51822,236,3321,032,0002,064,0002,498,560
4Feb 5, 2026 01:153,52317,068,3661,033,0002,067,0002,490,368
5Feb 5, 2026 01:143,52821,416,2371,035,0002,070,0002,490,368
6Feb 5, 2026 01:143,55019,879,1511,041,0002,083,0002,277,376