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 17, 2026 12:22Tomislav TunkovicTomislav TunkovicScore: 60,389Success
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 12:2760,25432,130,01521,185,0001,109,00028,672
2Aug 17, 2026 12:2760,29132,313,82821,200,0001,108,00028,672
3Aug 17, 2026 12:2760,35631,969,37321,241,0001,091,00028,672
4Aug 17, 2026 12:2760,37832,060,55221,231,0001,109,00028,672
5Aug 17, 2026 12:2760,38932,088,52521,231,0001,113,00032,768
6Aug 17, 2026 12:2760,38932,334,59621,243,0001,101,00028,672
7Aug 17, 2026 12:2760,44532,335,15121,277,0001,088,00028,672
8Aug 17, 2026 12:2760,51332,090,19521,279,0001,111,00028,672
9Aug 17, 2026 12:2760,59432,482,42921,315,0001,105,00028,672