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 17:03Matthew SillsMatthew SillsScore: 109,951Success
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 17:03108,63266,903,48738,185,0002,009,0002,289,664
2Jul 28, 2024 17:03108,82461,976,62739,259,0001,006,0002,273,280
3Jul 28, 2024 17:03108,95167,196,08040,312,00002,289,664
4Jul 28, 2024 17:03108,99763,120,71738,313,0002,016,0002,260,992
5Jul 28, 2024 17:03109,35467,423,87639,450,0001,011,0002,527,232
6Jul 28, 2024 17:03109,37862,968,67339,459,0001,011,0002,289,664
7Jul 28, 2024 17:03109,95169,006,01340,682,00002,289,664
8Jul 28, 2024 17:03110,33266,965,00338,832,0001,991,0002,523,136
9Jul 28, 2024 17:03110,34164,385,76538,835,0001,991,0002,285,568
10Jul 28, 2024 17:03111,062118,454,31041,092,86502,265,088
11Jul 28, 2024 17:03111,876114,702,20841,394,16202,277,376
12Jul 28, 2024 17:03112,661109,405,73441,684,56102,273,280