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 13:22IlyaIlyaScore: 58,945Success
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 13:2358,78131,266,38620,636,0001,113,0002,113,536
2Jul 7, 2026 13:2358,84531,346,17520,643,0001,130,0002,113,536
3Jul 7, 2026 13:2358,89431,474,85720,672,0001,119,0002,113,536
4Jul 7, 2026 13:2358,92731,439,05120,684,0001,119,0002,113,536
5Jul 7, 2026 13:2358,94531,451,94320,697,0001,113,0002,113,536
6Jul 7, 2026 13:2358,99431,424,15520,713,0001,115,0002,113,536
7Jul 7, 2026 13:2359,04831,472,62820,721,0001,127,0002,113,536
8Jul 7, 2026 13:2359,06731,509,70020,695,0001,160,0002,113,536
9Jul 7, 2026 13:2359,12931,591,37820,746,0001,132,0002,113,536