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:10Victor MerckléVictor MerckléScore: 65,240Success
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:1164,91034,945,03822,973,0001,044,0002,113,536
2May 12, 2026 01:1165,11334,212,58222,988,0001,104,0002,113,536
3May 12, 2026 01:1165,15934,266,15723,012,0001,097,0002,113,536
4May 12, 2026 01:1165,17232,907,39323,006,0001,108,0002,113,536
5May 12, 2026 01:1165,24037,010,92523,030,0001,109,0002,113,536
6May 12, 2026 01:1165,24534,631,91823,054,0001,087,0002,113,536
7May 12, 2026 01:1165,61634,793,48223,196,0001,082,0002,113,536
8May 12, 2026 01:1165,61634,771,20223,173,0001,105,0002,113,536
9May 12, 2026 01:1165,64833,913,01523,209,0001,081,0002,113,536