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 24, 2026 16:05Victor MerckléVictor MerckléScore: 63,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 16:0662,88330,695,16423,267,00002,113,536
2Jun 24, 2026 16:0663,11630,741,63623,353,00002,113,536
3Jun 24, 2026 16:0663,17030,832,61223,373,00002,113,536
4Jun 24, 2026 16:0663,40530,992,42323,460,00002,113,536
5Jun 24, 2026 16:0663,44030,885,00023,473,00002,113,536
6Jun 24, 2026 16:0663,49731,127,32323,494,00002,113,536
7Jun 24, 2026 16:0663,98131,118,50023,673,00002,113,536
8Jun 24, 2026 16:0664,11031,240,91123,721,00002,113,536
9Jun 24, 2026 16:0664,35931,288,56923,813,00002,113,536