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 listMar 15, 2026 22:11Elijah KinElijah KinScore: 145,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:11144,56280,168,41010,092,00043,396,0002,482,176
2Mar 15, 2026 22:11145,46879,867,60715,947,00037,876,0002,473,984
3Mar 15, 2026 22:11145,47680,110,32413,955,00039,871,0002,285,568
4Mar 15, 2026 22:11145,50084,887,07612,960,00040,875,0002,285,568
5Mar 15, 2026 22:11145,54980,044,56110,970,00042,883,0002,326,528
6Mar 15, 2026 22:11146,23887,720,4369,018,00045,090,0002,469,888
7Mar 15, 2026 22:11146,73878,082,60812,065,00042,228,0002,285,568
8Mar 15, 2026 22:11147,21675,881,34710,087,00044,383,0002,285,568
9Mar 15, 2026 22:11154,573108,048,15117,057,00040,135,0002,269,184