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 03:01vahookvahookScore: 3,475Success
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 03:003,45722,336,8991,014,0002,028,0002,494,464
2Feb 6, 2026 03:003,45820,290,2251,014,0002,029,0002,494,464
3Feb 6, 2026 03:003,46523,623,7301,016,0002,033,0002,502,656
4Feb 6, 2026 03:013,47518,157,7461,019,0002,039,0002,281,472
5Feb 6, 2026 03:013,47722,566,5881,020,0002,040,0002,277,376
6Feb 6, 2026 03:013,70216,630,6981,086,0002,172,0002,494,464