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 23, 2026 20:34Victor MerckléVictor MerckléScore: 111,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 20:35109,11848,189,55822,659,00017,715,0002,113,536
2Jun 23, 2026 20:35109,76748,275,62122,786,00017,828,0002,113,536
3Jun 23, 2026 20:35109,83548,069,29222,468,00018,171,0002,113,536
4Jun 23, 2026 20:35110,94848,540,88622,726,00018,325,0002,113,536
5Jun 23, 2026 20:35111,15649,256,25522,736,00018,392,0002,113,536
6Jun 23, 2026 20:35111,28348,636,88822,831,00018,344,0002,113,536
7Jun 23, 2026 20:35113,33249,390,95622,836,00019,097,0002,113,536
8Jun 23, 2026 20:35662,721252,988,668227,632,00017,575,0002,113,536
9Jun 23, 2026 20:35664,345253,304,104228,470,00017,338,0002,113,536