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 20, 2023 19:53mmalczakmmalczakScore: 84,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2023 19:5383,38661,081,82429,858,000995,0002,527,232
2Sep 20, 2023 19:5384,06859,884,55929,099,0002,006,0002,289,664
3Sep 20, 2023 19:5384,21455,235,32429,149,0002,010,0002,289,664
4Sep 20, 2023 19:5384,29750,269,18229,178,0002,012,0002,408,448
5Sep 20, 2023 19:5384,47852,860,12229,241,0002,016,0002,289,664
6Sep 20, 2023 19:5384,52465,044,99630,266,0001,008,0002,289,664
7Sep 20, 2023 19:5384,52457,115,77529,257,0002,017,0002,289,664
8Sep 20, 2023 19:5384,93558,623,89030,413,0001,013,0002,289,664
9Sep 20, 2023 19:5384,93855,562,31630,414,0001,013,0002,289,664
10Sep 20, 2023 19:5385,99096,694,36231,816,41802,273,280
11Sep 20, 2023 19:5386,757100,329,09732,100,18902,260,992
12Sep 20, 2023 19:5387,031103,701,55032,201,34102,260,992