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 listJul 2, 2026 12:36IlyaIlyaScore: 59,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:3758,88331,383,37620,690,0001,097,0002,113,536
2Jul 2, 2026 12:3758,90031,286,84520,607,0001,186,0002,113,536
3Jul 2, 2026 12:3758,97031,385,78320,693,0001,126,0002,113,536
4Jul 2, 2026 12:3759,04031,339,66720,655,0001,190,0002,113,536
5Jul 2, 2026 12:3759,07031,429,73320,680,0001,176,0002,113,536
6Jul 2, 2026 12:3759,17031,822,54820,689,0001,204,0002,113,536
7Jul 2, 2026 12:3759,18331,902,64420,655,0001,243,0002,113,536
8Jul 2, 2026 12:3759,18631,401,80420,699,0001,200,0002,113,536
9Jul 2, 2026 12:3759,21331,508,71120,690,0001,219,0002,113,536