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 listNov 7, 2025 17:14Daniel MastalerzDaniel MastalerzScore: 165,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2025 17:14165,25791,480,19060,143,0001,002,0002,473,984
2Nov 7, 2025 17:14165,26282,234,95160,145,0001,002,0002,269,184
3Nov 7, 2025 17:14165,42291,531,47259,200,0002,006,0002,469,888
4Nov 7, 2025 17:14165,47387,864,55759,218,0002,007,0002,265,088
5Nov 7, 2025 17:14165,56587,756,48859,251,0002,008,0002,265,088
6Nov 7, 2025 17:14165,65785,700,79560,289,0001,004,0002,478,080
7Nov 7, 2025 17:14165,88490,160,68259,365,0002,012,0002,527,232
8Nov 7, 2025 17:14166,18687,851,78160,481,0001,008,0002,273,280
9Nov 7, 2025 17:14166,24180,476,61760,501,0001,008,0002,269,184