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:18Robert BurkeRobert BurkeScore: 63,630Success
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:1863,20547,124,16523,386,00002,273,280
2Aug 2, 2022 08:1863,27344,149,54023,411,00002,535,424
3Aug 2, 2022 08:1863,37844,962,05323,450,00002,428,928
4Aug 2, 2022 08:1863,47043,174,68823,484,00002,273,280
5Aug 2, 2022 08:1863,53246,045,29823,507,00002,424,832
6Aug 2, 2022 08:1863,60348,110,73822,510,0001,023,0002,420,736
7Aug 2, 2022 08:1863,63048,566,10522,520,0001,023,0002,428,928
8Aug 2, 2022 08:1863,74357,169,78922,560,0001,025,0002,535,424
9Aug 2, 2022 08:1863,93849,151,05022,629,0001,028,0002,535,424
10Aug 2, 2022 08:1866,68596,810,51824,673,40402,273,280
11Aug 2, 2022 08:1866,75383,635,06124,698,57502,273,280
12Aug 2, 2022 08:1866,76698,610,35724,703,53702,277,376