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 listJun 12, 2026 01:34Victor MerckléVictor MerckléScore: 67,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 01:3866,83733,634,15123,568,0001,162,0002,129,920
2Jun 12, 2026 01:3866,88933,751,68223,606,0001,143,0002,134,016
3Jun 12, 2026 01:3866,95433,759,95823,630,0001,143,0002,134,016
4Jun 12, 2026 01:3867,00233,754,76623,640,0001,151,0002,129,920
5Jun 12, 2026 01:3867,07833,722,94323,653,0001,166,0002,129,920
6Jun 12, 2026 01:3867,08633,787,18723,669,0001,153,0002,134,016
7Jun 12, 2026 01:3867,09133,814,07123,673,0001,151,0002,129,920
8Jun 12, 2026 01:3867,27033,746,15723,749,0001,141,0002,129,920
9Jun 12, 2026 01:3867,28133,882,13523,743,0001,151,0002,129,920