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 26, 2023 09:05Yurkov AlekseyYurkov AlekseyScore: 98,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 09:0597,72756,878,46334,151,0002,008,0002,527,232
2Mar 26, 2023 09:0597,77063,366,95134,166,0002,009,0002,269,184
3Mar 26, 2023 09:0597,80561,201,57234,178,0002,010,0002,289,664
4Mar 26, 2023 09:0597,98657,714,38934,241,0002,014,0002,281,472
5Mar 26, 2023 09:0598,47664,210,55035,424,0001,012,0002,289,664
6Mar 26, 2023 09:0598,50859,068,35035,436,0001,012,0002,289,664
7Mar 26, 2023 09:0598,61460,121,18435,474,0001,013,0002,277,376
8Mar 26, 2023 09:0598,64667,013,08035,513,000986,0002,375,680
9Mar 26, 2023 09:0599,18662,469,38635,680,0001,019,0002,371,584
10Mar 26, 2023 09:0599,621106,697,58836,859,72902,269,184
11Mar 26, 2023 09:0599,68394,415,99236,882,76802,265,088
12Mar 26, 2023 09:05100,563125,461,35937,208,29002,265,088