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 18, 2023 07:09mmalczakmmalczakScore: 84,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2023 07:0983,41156,510,69928,871,0001,991,0002,289,664
2Sep 18, 2023 07:0983,48963,544,81130,891,00002,277,376
3Sep 18, 2023 07:0983,68454,306,67529,965,000998,0002,289,664
4Sep 18, 2023 07:0983,76854,740,75429,995,000999,0002,281,472
5Sep 18, 2023 07:0983,85154,783,59829,024,0002,001,0002,527,232
6Sep 18, 2023 07:0984,10552,456,44029,112,0002,007,0002,289,664
7Sep 18, 2023 07:0984,65759,640,46629,303,0002,020,0002,273,280
8Sep 18, 2023 07:0984,74658,927,39829,333,0002,023,0002,289,664
9Sep 18, 2023 07:0984,96560,045,01531,437,00002,269,184
10Sep 18, 2023 07:0985,13595,187,47531,500,06502,273,280
11Sep 18, 2023 07:0985,94895,515,72231,800,66702,269,184
12Sep 18, 2023 07:0986,385101,067,61831,962,28402,260,992