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 27, 2023 22:05Franek KortaFranek KortaScore: 72,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2023 22:0572,26852,701,88425,711,0001,028,0002,269,184
2Aug 27, 2023 22:0572,58652,719,99625,863,000994,0002,441,216
3Aug 27, 2023 22:0572,59256,200,63624,870,0001,989,0002,449,408
4Aug 27, 2023 22:0572,59256,547,48425,865,000994,0002,441,216
5Aug 27, 2023 22:0572,60856,771,22925,870,000995,0002,437,120
6Aug 27, 2023 22:0572,60853,083,78225,870,000995,0002,265,088
7Aug 27, 2023 22:0572,78453,668,75724,936,0001,994,0002,531,328
8Aug 27, 2023 22:0572,88652,113,75424,971,0001,997,0002,441,216
9Aug 27, 2023 22:0572,98148,652,10926,003,0001,000,0002,531,328
10Aug 27, 2023 22:0581,21485,640,31830,049,08002,289,664
11Aug 27, 2023 22:0581,28587,837,18330,075,42902,285,568
12Aug 27, 2023 22:0582,270106,305,13330,439,78802,285,568