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 listSep 16, 2023 10:32mmalczakmmalczakScore: 120,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 10:32108,794102,508,53940,253,83902,265,088
2Sep 16, 2023 10:32109,394110,297,41140,475,72202,265,088
3Sep 16, 2023 10:32110,64398,345,19540,937,86302,256,896
4Sep 16, 2023 10:32120,02770,877,86043,401,0001,009,0002,523,136
5Sep 16, 2023 10:32120,34970,121,47444,529,00002,273,280
6Sep 16, 2023 10:32120,41467,880,24343,541,0001,012,0002,289,664
7Sep 16, 2023 10:32120,53271,305,76243,584,0001,013,0002,523,136
8Sep 16, 2023 10:32120,71471,343,69844,664,00002,285,568
9Sep 16, 2023 10:32120,83072,079,68443,691,0001,016,0002,269,184
10Sep 16, 2023 10:32120,84670,113,87643,697,0001,016,0002,359,296
11Sep 16, 2023 10:32121,14170,308,03142,830,0001,992,0002,289,664
12Sep 16, 2023 10:32121,19274,055,30042,849,0001,992,0002,289,664