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 3, 2026 00:01A_ShamanA_ShamanScore: 70,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 00:0169,69135,291,84024,703,0001,083,0002,113,536
2Jul 3, 2026 00:0170,02436,084,77724,723,0001,186,0002,113,536
3Jul 3, 2026 00:0170,03235,465,03024,761,0001,151,0002,113,536
4Jul 3, 2026 00:0170,10835,944,90224,759,0001,181,0002,113,536
5Jul 3, 2026 00:0170,12135,836,06024,780,0001,165,0002,113,536
6Jul 3, 2026 00:0170,20835,467,64424,799,0001,178,0002,113,536
7Jul 3, 2026 00:0170,29135,950,48124,817,0001,191,0002,113,536
8Jul 3, 2026 00:0170,32136,017,29824,831,0001,188,0002,113,536
9Jul 3, 2026 00:0170,47236,130,92725,004,0001,071,0002,113,536