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 listSep 26, 2026 19:09Kevin HeaveyKevin HeaveyScore: 53,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 19:2953,60828,459,56119,835,000020,480
2Sep 26, 2026 19:2953,62928,415,41119,843,000020,480
3Sep 26, 2026 19:2953,65928,246,49719,854,000020,480
4Sep 26, 2026 19:2953,72928,431,22319,880,000020,480
5Sep 26, 2026 19:2953,79128,315,18019,903,000020,480
6Sep 26, 2026 19:2953,80028,431,28119,906,000020,480
7Sep 26, 2026 19:2953,80828,751,29019,909,000020,480
8Sep 26, 2026 19:2953,85128,558,34219,925,000020,480
9Sep 26, 2026 19:2953,90228,381,93119,944,000020,480