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 28, 2024 18:50Matthew SillsMatthew SillsScore: 98,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2024 18:5097,41468,367,10134,041,0002,002,0002,269,184
2Jul 28, 2024 18:5097,50059,704,49434,071,0002,004,0002,277,376
3Jul 28, 2024 18:5097,55166,196,91135,092,0001,002,0002,273,280
4Jul 28, 2024 18:5097,91158,940,53334,215,0002,012,0002,289,664
5Jul 28, 2024 18:5097,95957,389,84234,232,0002,013,0002,527,232
6Jul 28, 2024 18:5098,03263,213,98835,265,0001,007,0002,289,664
7Jul 28, 2024 18:5098,46859,292,83436,433,00002,265,088
8Jul 28, 2024 18:5098,71664,105,76735,511,0001,014,0002,289,664
9Jul 28, 2024 18:5098,76858,100,21935,529,0001,015,0002,289,664
10Jul 28, 2024 18:5099,164105,349,64036,690,79702,273,280
11Jul 28, 2024 18:5099,402101,835,57336,778,89802,273,280
12Jul 28, 2024 18:50100,107102,766,37537,039,76902,252,800