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:25DanielDanielScore: 93,143Success
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:2592,43058,916,21032,188,0002,011,0002,289,664
2Jul 24, 2024 18:2592,46267,657,58833,205,0001,006,0002,367,488
3Jul 24, 2024 18:2592,74358,520,57933,306,0001,009,0002,367,488
4Jul 24, 2024 18:2592,93056,208,10333,373,0001,011,0002,367,488
5Jul 24, 2024 18:2593,01455,944,41533,403,0001,012,0002,289,664
6Jul 24, 2024 18:2593,07055,918,19734,436,00002,367,488
7Jul 24, 2024 18:2593,14368,040,25033,450,0001,013,0002,363,392
8Jul 24, 2024 18:2593,37362,291,55033,532,0001,016,0002,363,392
9Jul 24, 2024 18:2593,47660,391,72234,586,00002,473,984
10Jul 24, 2024 18:2594,659105,672,49135,023,95802,211,840
11Jul 24, 2024 18:2594,757109,646,95435,059,90502,260,992
12Jul 24, 2024 18:2594,82697,813,13235,085,65702,207,744