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 listMar 30, 2026 05:52limanjun99limanjun99Score: 58,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 05:5258,35951,687,34720,565,0001,028,0002,281,472
2Mar 30, 2026 05:5258,55149,632,57021,664,00002,281,472
3Mar 30, 2026 05:5258,68653,930,14521,714,00002,396,160