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 29, 2026 20:38Andrew TsibinAndrew TsibinScore: 76,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 20:3964,85934,055,35421,846,0002,152,0002,113,536
2Jul 29, 2026 20:3972,62436,921,59921,678,0005,193,00020,480
3Jul 29, 2026 20:3972,71637,021,48221,691,0005,214,0002,113,536
4Jul 29, 2026 20:3976,52738,363,80722,114,0006,201,0002,113,536
5Jul 29, 2026 20:3976,84338,497,13922,121,0006,311,0002,113,536
6Jul 29, 2026 20:3978,37239,160,28222,154,0006,844,0002,113,536
7Jul 29, 2026 20:3981,01340,041,04622,264,0007,711,0002,113,536
8Jul 29, 2026 20:3983,21040,880,06222,405,0008,383,0002,113,536
9Jul 29, 2026 20:3985,18143,116,37022,532,0008,985,0002,113,536