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 listOct 9, 2026 21:36highload-churnerhighload-churnerScore: 56,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 22:1256,25929,904,16120,816,000020,480
2Oct 9, 2026 22:1256,38329,869,94120,862,000020,480
3Oct 9, 2026 22:1256,38929,970,18220,864,000020,480
4Oct 9, 2026 22:1256,48630,051,43720,900,000020,480
5Oct 9, 2026 22:1256,51829,991,52420,912,000020,480
6Oct 9, 2026 22:1256,52929,912,75220,916,000020,480
7Oct 9, 2026 22:1256,57229,992,24120,932,000020,480
8Oct 9, 2026 22:1256,60529,913,11020,944,000020,480
9Oct 9, 2026 22:1256,64529,980,62120,959,000020,480