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 11, 2026 16:10Victor MerckléVictor MerckléScore: 67,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:1167,37036,216,45423,715,0001,212,0002,113,536
2May 11, 2026 16:1167,40233,662,37123,723,0001,216,0002,113,536
3May 11, 2026 16:1167,41835,371,69723,751,0001,194,0002,113,536
4May 11, 2026 16:1167,48633,948,57923,757,0001,213,0002,113,536
5May 11, 2026 16:1167,62736,581,39223,786,0001,236,0002,113,536
6May 11, 2026 16:1167,88133,874,27123,896,0001,220,0002,113,536
7May 11, 2026 16:1167,88636,385,32523,881,0001,237,0002,113,536
8May 11, 2026 16:1168,08134,170,19424,006,0001,184,0002,113,536
9May 11, 2026 16:11190,38679,013,39369,290,0001,153,0002,113,536