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 2, 2023 22:00Franek KortaFranek KortaScore: 61,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2023 22:0060,82442,552,64922,505,00002,531,328
2Sep 2, 2023 22:0060,94646,720,16918,450,0004,100,0002,531,328
3Sep 2, 2023 22:0060,95747,159,59122,554,00002,437,120
4Sep 2, 2023 22:0061,01949,468,19920,525,0002,052,0002,531,328
5Sep 2, 2023 22:0061,05444,917,55019,510,0003,080,0002,449,408
6Sep 2, 2023 22:0061,07848,241,36020,545,0002,054,0002,527,232
7Sep 2, 2023 22:0061,17047,508,57521,605,0001,028,0002,441,216
8Sep 2, 2023 22:0061,33552,110,78622,694,00002,531,328
9Sep 2, 2023 22:0061,38653,391,46620,649,0002,064,0002,441,216
10Sep 2, 2023 22:0064,90886,920,01724,015,93802,301,952
11Sep 2, 2023 22:0064,98194,598,87824,043,00902,174,976
12Sep 2, 2023 22:0065,21580,662,93524,129,65002,232,320