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 11, 2021 05:42Sergey StreminSergey StreminScore: 113,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 05:42113,17868,207,37439,882,0001,994,0002,371,584
2Sep 11, 2021 05:42113,24967,686,19739,907,0001,995,0002,285,568
3Sep 11, 2021 05:42113,27868,122,92639,918,0001,995,0002,285,568
4Sep 11, 2021 05:42113,50372,050,63040,997,000999,0002,367,488
5Sep 11, 2021 05:42113,59569,378,93541,030,0001,000,0002,285,568
6Sep 11, 2021 05:42113,80564,531,58041,106,0001,002,0002,285,568
7Sep 11, 2021 05:42113,89769,940,58840,136,0002,006,0002,371,584
8Sep 11, 2021 05:42113,90370,246,22940,138,0002,006,0002,285,568
9Sep 11, 2021 05:42114,126107,664,22442,226,75802,256,896
10Sep 11, 2021 05:42114,29570,894,90841,283,0001,006,0002,379,776
11Sep 11, 2021 05:42115,847119,436,42642,863,21902,207,744
12Sep 11, 2021 05:42116,968104,510,17543,278,11102,211,840