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 18:26Franek KortaFranek KortaScore: 79,930Success
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 18:2677,99753,046,09726,798,0002,061,0002,379,776
2Aug 6, 2022 18:2679,62253,573,76727,429,0002,031,0002,371,584
3Aug 6, 2022 18:2679,65451,945,38027,440,0002,032,0002,281,472
4Aug 6, 2022 18:2679,73054,953,43129,500,00002,281,472
5Aug 6, 2022 18:2679,87056,417,21228,533,0001,019,0002,281,472
6Aug 6, 2022 18:2679,89750,265,74028,543,0001,019,0002,281,472
7Aug 6, 2022 18:2679,93059,814,27229,574,00002,277,376
8Aug 6, 2022 18:2679,94151,743,65828,559,0001,019,0002,285,568
9Aug 6, 2022 18:2680,00051,942,97427,559,0002,041,0002,260,992
10Aug 6, 2022 18:2682,22187,338,48530,421,75202,256,896
11Aug 6, 2022 18:2682,554105,566,61730,544,88502,256,896
12Aug 6, 2022 18:2682,807111,127,28630,638,67102,260,992