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 29, 2021 16:17piculpiculScore: 72,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2021 16:1770,37599,560,63626,038,60002,269,184
2Sep 29, 2021 16:1770,74485,095,22326,175,24202,260,992
3Sep 29, 2021 16:1771,15281,581,46526,326,22002,277,376
4Sep 29, 2021 16:1772,20853,066,54226,717,00002,281,472
5Sep 29, 2021 16:1772,50055,556,27524,838,0001,987,0002,289,664
6Sep 29, 2021 16:1772,55750,294,86625,852,000994,0002,289,664
7Sep 29, 2021 16:1772,55750,499,23824,858,0001,988,0002,289,664
8Sep 29, 2021 16:1772,57658,095,96025,859,000994,0002,289,664
9Sep 29, 2021 16:1772,57657,195,48124,864,0001,989,0002,289,664
10Sep 29, 2021 16:1772,61948,234,17124,879,0001,990,0002,289,664
11Sep 29, 2021 16:1772,86550,337,78324,963,0001,997,0002,277,376
12Sep 29, 2021 16:1772,93050,776,04224,986,0001,998,0002,281,472