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 listJul 24, 2024 18:17DanielDanielScore: 93,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 18:1792,55957,679,29633,240,0001,007,0002,371,584
2Jul 24, 2024 18:1792,83264,240,27932,328,0002,020,0002,359,296
3Jul 24, 2024 18:1792,84667,128,28732,333,0002,020,0002,375,680
4Jul 24, 2024 18:1792,87056,084,09533,352,0001,010,0002,289,664
5Jul 24, 2024 18:1792,88960,624,03834,369,00002,289,664
6Jul 24, 2024 18:1793,57861,077,05434,624,00002,371,584
7Jul 24, 2024 18:1793,69562,964,23134,667,00002,371,584
8Jul 24, 2024 18:1794,18962,219,59333,855,000995,0002,289,664
9Jul 24, 2024 18:1794,23092,394,72034,865,20102,211,840
10Jul 24, 2024 18:1794,43066,499,81032,943,0001,996,0002,363,392
11Jul 24, 2024 18:1795,206114,934,51035,226,14702,260,992
12Jul 24, 2024 18:1795,429105,992,29835,308,78602,211,840