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:13Matthew SillsMatthew SillsScore: 96,035Success
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:1395,13055,784,68533,187,0002,011,0002,273,280
2Jul 28, 2024 18:1395,30358,672,99834,255,0001,007,0002,269,184
3Jul 28, 2024 18:1395,34356,300,94033,262,0002,015,0002,289,664
4Jul 28, 2024 18:1395,40361,811,57833,282,0002,017,0002,289,664
5Jul 28, 2024 18:1395,46859,791,62733,305,0002,018,0002,289,664
6Jul 28, 2024 18:1395,54962,130,72033,333,0002,020,0002,289,664
7Jul 28, 2024 18:1396,03557,598,47235,533,00002,289,664
8Jul 28, 2024 18:1396,05957,348,54834,527,0001,015,0002,289,664
9Jul 28, 2024 18:1396,07860,734,17134,534,0001,015,0002,289,664
10Jul 28, 2024 18:1398,024116,287,46936,268,95702,396,160
11Jul 28, 2024 18:1398,797101,624,40636,554,90902,260,992
12Jul 28, 2024 18:1399,296100,619,55636,739,41802,277,376