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 listMay 12, 2026 01:28Victor MerckléVictor MerckléScore: 65,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:2965,21835,053,59923,117,0001,014,0002,113,536
2May 12, 2026 01:2965,29132,815,72823,128,0001,030,0002,113,536
3May 12, 2026 01:2965,30832,840,57623,081,0001,083,0002,113,536
4May 12, 2026 01:2965,33535,980,36023,093,0001,081,0002,113,536
5May 12, 2026 01:2965,36233,506,81323,097,0001,087,0002,113,536
6May 12, 2026 01:2965,43733,575,40523,134,0001,078,0002,113,536
7May 12, 2026 01:2965,79433,067,05223,255,0001,089,0002,113,536
8May 12, 2026 01:2965,82133,108,55823,274,0001,080,0002,113,536
9May 12, 2026 01:2965,82436,953,83223,266,0001,089,0002,113,536