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 6, 2022 21:58Franek KortaFranek KortaScore: 77,341Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 21:5876,54654,024,35227,311,0001,011,0002,330,624
2Aug 6, 2022 21:5876,55150,685,20825,290,0003,034,0002,371,584
3Aug 6, 2022 21:5876,61153,062,98726,322,0002,024,0002,330,624
4Aug 6, 2022 21:5876,85452,490,95326,405,0002,031,0002,342,912
5Aug 6, 2022 21:5877,03053,543,33028,501,00002,342,912
6Aug 6, 2022 21:5877,08956,000,26126,486,0002,037,0002,359,296
7Aug 6, 2022 21:5877,34153,706,27527,594,0001,022,0002,322,432
8Aug 6, 2022 21:5877,56256,191,25627,674,0001,024,0002,310,144
9Aug 6, 2022 21:5877,93254,347,42527,841,000994,0002,306,048
10Aug 6, 2022 21:5881,459101,577,09430,139,81102,277,376
11Aug 6, 2022 21:5881,563108,644,08830,178,44302,310,144
12Aug 6, 2022 21:5881,93399,061,95330,315,23602,306,048