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 8, 2026 22:51zielajzielajScore: 3,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 22:483,42625,001,0302,010,0001,005,0002,404,352
2Feb 8, 2026 22:503,43422,585,2462,015,0001,007,0002,408,448
3Feb 8, 2026 22:483,45121,639,2492,025,0001,012,0002,404,352
4Feb 8, 2026 22:503,45717,895,4582,028,0001,014,0002,535,424
5Feb 8, 2026 22:513,45815,683,9652,029,0001,014,0002,404,352
6Feb 8, 2026 22:483,46818,677,1422,035,0001,017,0002,535,424
7Feb 8, 2026 22:513,47025,688,0942,036,0001,018,0002,404,352
8Feb 8, 2026 22:503,47218,893,3482,037,0001,018,0002,400,256
9Feb 8, 2026 22:513,56717,388,1332,093,0001,046,0002,404,352