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 7, 2026 19:01Victor MerckléVictor MerckléScore: 56,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 19:0256,67528,766,31420,970,00002,113,536
2Jul 7, 2026 19:0256,68929,070,38419,975,0001,000,0002,113,536
3Jul 7, 2026 19:0256,73228,792,91820,991,00002,113,536
4Jul 7, 2026 19:0256,74528,804,36619,989,0001,007,0002,113,536
5Jul 7, 2026 19:0256,77028,810,62221,005,00002,113,536
6Jul 7, 2026 19:0256,79728,857,68821,015,00002,113,536
7Jul 7, 2026 19:0256,86228,877,43320,003,0001,036,0002,113,536
8Jul 7, 2026 19:0257,05628,937,40820,108,0001,003,0002,113,536
9Jul 7, 2026 19:0257,36729,101,72120,186,0001,040,0002,113,536