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 14, 2022 21:08Franek KortaFranek KortaScore: 191,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2022 21:08191,442134,728,58270,833,53502,289,664
2Mar 31, 2023 17:51191,520129,438,45570,862,43102,240,512
3Mar 31, 2023 17:42191,644134,613,81870,908,30902,293,760
4Mar 31, 2023 17:51191,680136,600,79770,921,43202,297,856
5Mar 31, 2023 17:42191,705135,500,91670,930,95202,293,760
6Mar 31, 2023 17:42191,855146,132,93370,986,45102,297,856
7Mar 31, 2023 17:42191,910131,384,44471,006,55802,240,512
8Aug 14, 2022 21:08191,931134,890,24771,014,53002,297,856
9Aug 14, 2022 21:08191,969160,542,31671,028,64502,285,568
10Mar 31, 2023 17:51192,118155,274,87671,083,75502,285,568
11Mar 31, 2023 17:42192,126139,440,43871,086,54302,293,760
12Mar 31, 2023 17:42192,134147,823,64871,089,42302,301,952