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 15, 2025 09:14Valentin KofmanValentin KofmanScore: 85,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 09:1484,60853,875,43729,286,0002,019,0002,273,280
2Jul 15, 2025 09:1484,67855,998,84629,310,0002,021,0002,281,472
3Jul 15, 2025 09:1485,10554,766,82230,474,0001,015,0002,273,280
4Jul 15, 2025 09:1485,18454,206,05830,502,0001,016,0002,281,472
5Jul 15, 2025 09:1485,52457,655,02930,624,0001,020,0002,281,472
6Jul 15, 2025 09:1485,81959,422,95529,769,0001,984,0002,269,184
7Jul 15, 2025 09:1486,26256,506,93829,923,0001,994,0002,269,184
8Jul 15, 2025 09:1486,47054,145,48129,995,0001,999,0002,281,472
9Jul 15, 2025 09:1486,55758,937,73631,026,0001,000,0002,514,944