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:16Robert BurkeRobert BurkeScore: 67,441Success
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:1665,23044,554,25523,130,0001,005,0002,424,832
2Aug 2, 2022 08:1665,62442,922,87424,281,00002,535,424
3Aug 2, 2022 08:1666,11139,917,04823,442,0001,019,0002,416,640
4Aug 2, 2022 08:1666,35144,748,32324,550,00002,539,520
5Aug 2, 2022 08:1666,54151,084,89723,595,0001,025,0002,514,944
6Aug 2, 2022 08:1667,39252,079,97922,941,0001,994,0002,273,280
7Aug 2, 2022 08:1667,44175,308,21524,953,07702,273,280
8Aug 2, 2022 08:1667,44147,592,54823,955,000998,0002,273,280
9Aug 2, 2022 08:1668,16382,951,24125,220,36002,277,376
10Aug 2, 2022 08:1668,74290,318,29025,434,48602,269,184
11Aug 2, 2022 08:1670,42248,133,55525,054,0001,002,0002,433,024
12Aug 2, 2022 08:1670,82750,950,84626,206,00002,535,424