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 listAug 16, 2026 23:14Tomislav TunkovicTomislav TunkovicScore: 292,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:32292,183116,563,784107,098,0001,010,00045,056
2Aug 17, 2026 05:32292,394116,653,144107,179,0001,007,00045,056
3Aug 17, 2026 05:32292,443116,987,215107,196,0001,008,00045,056
4Aug 17, 2026 05:32292,613116,777,719107,260,0001,007,00045,056
5Aug 17, 2026 05:32292,637116,682,559107,269,0001,007,00045,056
6Aug 17, 2026 05:32292,664116,716,567107,278,0001,008,00045,056
7Aug 17, 2026 05:32292,727116,713,113107,301,0001,008,00045,056
8Aug 17, 2026 05:32292,751116,737,241107,311,0001,007,00045,056
9Aug 17, 2026 05:32293,140117,598,225107,455,0001,007,00045,056