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 11, 2026 10:42Victor MerckléVictor MerckléScore: 63,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 10:4362,96730,746,16623,298,00002,113,536
2Jun 11, 2026 10:4363,18330,909,60323,378,00002,113,536
3Jun 11, 2026 10:4363,30531,014,01723,423,00002,113,536
4Jun 11, 2026 10:4363,30531,555,20823,423,00002,113,536
5Jun 11, 2026 10:4363,32130,835,77523,429,00002,113,536
6Jun 11, 2026 10:4363,43730,852,00323,472,00002,113,536
7Jun 11, 2026 10:4363,61630,910,97323,538,00002,113,536
8Jun 11, 2026 10:4363,65631,115,62223,553,00002,113,536
9Jun 11, 2026 10:4363,90531,147,65922,640,0001,005,0002,113,536