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 7, 2026 12:04IlyaIlyaScore: 61,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:0661,24832,281,30221,529,0001,133,0002,113,536
2Jul 7, 2026 12:0661,27832,327,97521,526,0001,147,0002,113,536
3Jul 7, 2026 12:0661,41332,338,53321,526,0001,197,0002,113,536
4Jul 7, 2026 12:0661,41833,020,70521,508,0001,217,0002,113,536
5Jul 7, 2026 12:0661,42433,840,41121,538,0001,189,0002,113,536
6Jul 7, 2026 12:0661,49732,417,26521,503,0001,251,0002,113,536
7Jul 7, 2026 12:0661,71832,504,49021,589,0001,247,0002,113,536
8Jul 7, 2026 12:0661,91040,940,37321,635,0001,272,0002,113,536
9Jul 7, 2026 12:0663,54342,325,90622,486,0001,025,0002,113,536