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 8, 2026 21:09IlyaIlyaScore: 59,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 21:1158,99133,081,62720,708,0001,119,0002,113,536
2Jul 8, 2026 21:1159,03231,449,87720,724,0001,118,0002,113,536
3Jul 8, 2026 21:1159,06231,542,53420,708,0001,145,0002,113,536
4Jul 8, 2026 21:1159,08631,527,43420,718,0001,144,0002,113,536
5Jul 8, 2026 21:1159,16231,528,28920,773,0001,117,0002,113,536
6Jul 8, 2026 21:1159,34831,598,01020,821,0001,138,0002,113,536
7Jul 8, 2026 21:1159,35131,645,43220,760,0001,200,0002,113,536
8Jul 8, 2026 21:1159,41831,870,58820,792,0001,193,0002,113,536
9Jul 8, 2026 21:1159,49431,680,03120,825,0001,188,0002,113,536