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 28, 2026 16:29Victor MerckléVictor MerckléScore: 56,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 16:3056,14529,210,99920,774,00002,113,536
2Aug 28, 2026 16:3056,18629,092,47519,787,0001,002,0002,113,536
3Aug 28, 2026 16:3056,22428,937,83320,803,00002,113,536
4Aug 28, 2026 16:3056,26728,990,23819,810,0001,009,0002,113,536
5Aug 28, 2026 16:3056,33229,874,90419,809,0001,034,0002,113,536
6Aug 28, 2026 16:3056,34329,013,48620,847,00002,113,536
7Aug 28, 2026 16:3056,37829,008,53519,824,0001,036,0002,113,536
8Aug 28, 2026 16:3056,47829,997,19219,885,0001,012,0002,113,536
9Aug 28, 2026 16:3056,51329,967,67619,873,0001,037,0002,113,536