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 16:53vahookvahookScore: 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 16:533,45722,872,0201,014,0002,028,0002,281,472
2Feb 5, 2026 16:533,45821,930,9461,014,0002,029,0002,498,560
3Feb 5, 2026 16:533,46720,835,5511,017,0002,034,0002,277,376
4Feb 5, 2026 16:533,47024,440,7461,018,0002,036,0002,498,560
5Feb 5, 2026 16:533,47016,629,8101,018,0002,036,0002,494,464
6Feb 5, 2026 16:533,47220,108,0971,018,0002,037,0002,486,272
7Feb 5, 2026 16:533,47521,331,1451,019,0002,039,0002,502,656
8Feb 5, 2026 16:533,51918,617,1741,032,0002,065,0002,494,464
9Feb 5, 2026 16:533,52317,096,8281,033,0002,067,0002,498,560