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 15, 2021 15:35Mikhail ShirokovMikhail ShirokovScore: 108,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 15:35108,12467,660,93438,006,0002,000,0002,387,968
2Sep 15, 2021 15:35108,44668,236,14638,119,0002,006,0002,387,968
3Sep 15, 2021 15:35108,83065,756,69838,254,0002,013,0002,519,040
4Sep 15, 2021 15:35108,83265,912,51039,262,0001,006,0002,519,040
5Sep 15, 2021 15:35108,89764,386,80039,285,0001,007,0002,519,040
6Sep 15, 2021 15:35108,93563,730,49138,291,0002,015,0002,383,872
7Sep 15, 2021 15:35108,97868,000,84037,298,0003,024,0002,519,040
8Sep 15, 2021 15:35109,56265,314,88639,525,0001,013,0002,523,136
9Sep 15, 2021 15:35110,37068,555,70339,841,000996,0002,519,040
10Sep 15, 2021 15:35112,265116,495,79541,537,92302,244,608
11Sep 15, 2021 15:35112,713109,925,68641,703,85102,244,608
12Sep 15, 2021 15:35113,341109,887,31441,936,32702,244,608