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 listMar 31, 2023 17:58Franek KortaFranek KortaScore: 73,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2023 17:5873,54354,957,73924,188,0003,023,0002,281,472
2Mar 31, 2023 17:5873,57648,798,17125,207,0002,016,0002,281,472
3Mar 31, 2023 17:5873,60551,710,82925,217,0002,017,0002,531,328
4Mar 31, 2023 17:5873,77650,478,83225,275,0002,022,0002,281,472
5Mar 31, 2023 17:5873,79754,339,45725,283,0002,022,0002,269,184
6Mar 31, 2023 17:5873,97053,014,29426,356,0001,013,0002,281,472
7Mar 31, 2023 17:5873,98649,564,66127,375,00002,281,472
8Mar 31, 2023 17:5874,03553,016,55526,379,0001,014,0002,281,472
9Mar 31, 2023 17:5874,29548,564,64726,471,0001,018,0002,273,280
10Mar 31, 2023 17:5877,77494,655,39928,776,55002,269,184
11Mar 31, 2023 17:5878,20988,644,91528,937,22102,265,088
12Mar 31, 2023 17:5879,42999,804,04129,388,60902,260,992