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 listMay 26, 2025 06:30E SequeiraE SequeiraScore: 194,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 06:29194,757102,352,09971,060,0001,000,0002,265,088
2May 26, 2025 06:30194,88996,570,84270,106,0002,003,0002,514,944
3May 26, 2025 06:29194,908103,012,89270,113,0002,003,0002,269,184
4May 26, 2025 06:29194,992102,167,78970,143,0002,004,0002,371,584
5May 26, 2025 06:30195,00398,601,19370,147,0002,004,0002,289,664
6May 26, 2025 06:30195,01199,826,60870,150,0002,004,0002,265,088