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 2, 2026 12:39IlyaIlyaScore: 59,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:4158,69131,180,22020,617,0001,099,0002,113,536
2Jul 2, 2026 12:4158,89431,277,96520,668,0001,123,0002,113,536
3Jul 2, 2026 12:4158,89731,297,02920,695,0001,097,0002,113,536
4Jul 2, 2026 12:4158,91631,238,11920,707,0001,092,0002,113,536
5Jul 2, 2026 12:4159,02131,620,80820,605,0001,233,0002,113,536
6Jul 2, 2026 12:4159,05631,351,60420,728,0001,123,0002,113,536
7Jul 2, 2026 12:4159,05632,663,59520,664,0001,187,0002,113,536
8Jul 2, 2026 12:4159,13732,695,48320,698,0001,183,0002,113,536
9Jul 2, 2026 12:4161,20540,944,87221,477,0001,169,0002,113,536