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 17:33piculpiculScore: 83,568Success
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 17:3380,81653,703,18527,909,0001,993,0002,289,664
2Sep 15, 2021 17:3382,33856,108,10629,450,0001,015,0002,289,664
3Sep 15, 2021 17:3382,49555,243,24929,506,0001,017,0002,289,664
4Sep 15, 2021 17:3382,65458,145,09829,563,0001,019,0002,289,664
5Sep 15, 2021 17:3382,73064,947,11529,590,0001,020,0002,265,088
6Sep 15, 2021 17:3383,37056,532,93129,852,000995,0002,289,664
7Sep 15, 2021 17:3383,56856,404,81229,923,000997,0002,289,664
8Sep 15, 2021 17:3383,97652,934,92329,067,0002,004,0002,289,664
9Sep 15, 2021 17:3384,92253,971,75730,408,0001,013,0002,289,664
10Sep 15, 2021 17:3385,484100,497,86131,629,02502,256,896
11Sep 15, 2021 17:3386,85697,950,65832,136,79502,256,896
12Sep 15, 2021 17:3387,79793,920,34132,484,74502,256,896