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 listApr 9, 2023 21:26Franek KortaFranek KortaScore: 89,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 21:2686,715104,104,15632,084,63902,293,760
2Apr 9, 2023 21:2686,98393,322,79732,183,89402,293,760
3Apr 9, 2023 21:2687,41654,036,20732,344,00002,527,232
4Apr 9, 2023 21:2687,51653,986,45831,370,0001,011,0002,420,736
5Apr 9, 2023 21:2687,89255,751,19029,472,0003,048,0002,424,832
6Apr 9, 2023 21:2688,771101,355,23432,845,22402,170,880
7Apr 9, 2023 21:2689,48956,910,81332,108,0001,003,0002,424,832
8Apr 9, 2023 21:2689,58155,774,71532,141,0001,004,0002,433,024
9Apr 9, 2023 21:2689,73856,646,41330,185,0003,018,0002,437,120
10Apr 9, 2023 21:2689,87352,818,09331,238,0002,015,0002,531,328
11Apr 9, 2023 21:2690,87860,396,68431,588,0002,037,0002,433,024
12Apr 9, 2023 21:2691,51663,161,78931,870,0001,991,0002,527,232