TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listFeb 12, 2026 14:36Alex KentAlex KentScore: 500,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 14:36490,154204,369,13338,862,000142,495,0002,301,952
2Feb 12, 2026 14:36493,324205,488,73738,900,000143,630,0002,490,368
3Feb 12, 2026 14:36495,873211,885,67439,885,000143,588,0002,355,200
4Feb 12, 2026 14:36499,905210,315,42238,992,000145,973,0002,310,144
5Feb 12, 2026 14:36500,141212,190,17740,011,000145,041,0002,297,856
6Feb 12, 2026 14:36500,616207,172,12839,048,000146,180,0002,310,144
7Feb 12, 2026 14:36504,473215,306,50139,926,000146,729,0002,498,560
8Feb 12, 2026 14:36510,673216,199,81645,987,000142,962,0002,310,144
9Feb 12, 2026 14:36526,343220,557,22745,940,000148,807,0002,285,568