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 listAug 2, 2022 08:24Robert BurkeRobert BurkeScore: 62,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 08:2462,55142,250,05922,138,0001,006,0002,428,928
2Aug 2, 2022 08:2462,61646,227,54422,161,0001,007,0002,424,832
3Aug 2, 2022 08:2462,63245,535,38722,167,0001,007,0002,514,944
4Aug 2, 2022 08:2462,77044,729,62722,216,0001,009,0002,535,424
5Aug 2, 2022 08:2462,78644,601,36322,221,0001,010,0002,433,024
6Aug 2, 2022 08:2462,85144,108,48822,244,0001,011,0002,273,280
7Aug 2, 2022 08:2462,88446,583,10822,256,0001,011,0002,433,024
8Aug 2, 2022 08:2462,90044,670,27421,250,0002,023,0002,510,848
9Aug 2, 2022 08:2462,95445,492,42922,281,0001,012,0002,535,424
10Aug 2, 2022 08:2465,75763,508,15324,330,06902,285,568
11Aug 2, 2022 08:2465,86789,050,23124,370,67602,273,280
12Aug 2, 2022 08:2465,87683,762,95724,374,21702,265,088