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 listOct 19, 2026 23:08e1011e1011Score: 97,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 23:0985,56442,580,35130,556,0001,103,0002,113,536
2Oct 19, 2026 23:0985,91842,746,79530,682,0001,108,0002,113,536
3Oct 19, 2026 23:0987,48343,765,53331,129,0001,240,0002,113,536
4Oct 19, 2026 23:0997,41346,940,53034,918,0001,125,0002,113,536
5Oct 19, 2026 23:0997,71047,657,99634,957,0001,196,0002,113,536
6Oct 19, 2026 23:0997,72947,021,19135,045,0001,115,0002,113,536
7Oct 19, 2026 23:0998,19447,195,76135,211,0001,121,0002,113,536
8Oct 19, 2026 23:0998,48647,373,62335,218,0001,222,0002,113,536
9Oct 19, 2026 23:0998,50047,401,88735,249,0001,196,0002,113,536