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 6, 2022 15:04Eugene ZhydzetskiEugene ZhydzetskiScore: 111,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2022 15:04110,72764,501,71439,970,000999,0002,334,720
2Sep 6, 2022 15:04110,87867,268,04139,024,0002,001,0002,334,720
3Sep 6, 2022 15:04110,99766,060,44338,064,0003,005,0002,330,624
4Sep 6, 2022 15:04111,20066,187,89639,137,0002,007,0002,334,720
5Sep 6, 2022 15:04111,40070,379,56240,213,0001,005,0002,334,720
6Sep 6, 2022 15:04111,48161,122,13539,236,0002,012,0002,519,040
7Sep 6, 2022 15:04111,51965,930,37040,256,0001,006,0002,334,720
8Sep 6, 2022 15:04111,98467,174,31440,424,0001,010,0002,519,040
9Sep 6, 2022 15:04112,05165,021,35740,448,0001,011,0002,506,752
10Sep 6, 2022 15:04113,79499,044,59542,103,60902,187,264
11Sep 6, 2022 15:04114,027102,596,41342,190,02402,187,264
12Sep 6, 2022 15:04114,226106,189,50542,263,51102,187,264