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 25, 2026 14:15Dominique GarmierDominique GarmierScore: 102,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 14:15101,46557,883,85036,528,0001,014,0002,482,176
2Mar 25, 2026 16:50101,49559,768,16836,539,0001,014,0002,478,080
3Mar 25, 2026 15:16101,64664,836,42636,593,0001,016,0002,478,080
4Mar 25, 2026 16:10101,66267,624,40636,599,0001,016,0002,478,080
5Mar 25, 2026 15:16101,81661,128,48136,654,0001,018,0002,277,376
6Mar 25, 2026 16:50102,29260,169,83636,852,000996,0002,277,376
7Mar 25, 2026 16:10102,30860,276,49335,862,0001,992,0002,273,280
8Mar 25, 2026 15:16102,54963,761,35135,946,0001,997,0002,273,280
9Mar 25, 2026 14:15102,63562,459,29635,977,0001,998,0002,277,376
10Mar 25, 2026 14:15102,74660,042,60536,016,0002,000,0002,277,376
11Mar 25, 2026 16:10103,20560,704,32036,177,0002,009,0002,469,888
12Mar 25, 2026 16:50104,36566,645,97337,599,0001,016,0002,277,376