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 19:14Matthew SillsMatthew SillsScore: 72,851Success
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 19:1472,45156,218,89824,822,0001,985,0002,289,664
2Jul 28, 2024 19:1472,46252,473,44125,818,000993,0002,289,664
3Jul 28, 2024 19:1472,61152,767,56324,876,0001,990,0002,289,664
4Jul 28, 2024 19:1472,70054,933,36224,907,0001,992,0002,289,664
5Jul 28, 2024 19:1472,72253,074,89324,914,0001,993,0002,289,664
6Jul 28, 2024 19:1472,84354,986,81924,956,0001,996,0002,273,280
7Jul 28, 2024 19:1472,85151,322,67624,959,0001,996,0002,277,376
8Jul 28, 2024 19:1473,09553,279,98425,042,0002,003,0002,269,184
9Jul 28, 2024 19:1473,25947,236,17727,106,00002,289,664
10Jul 28, 2024 19:1475,405101,566,24627,899,73402,400,256
11Jul 28, 2024 19:1475,819103,940,21828,052,92702,265,088
12Jul 28, 2024 19:1476,05995,150,01628,141,98302,269,184