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 16, 2026 22:17izotoffizotoffScore: 137,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:17137,91472,823,56749,027,0002,001,0002,514,944
2Mar 16, 2026 22:17137,97873,394,02550,051,0001,001,0002,404,352
3Mar 16, 2026 22:17138,82776,685,02148,345,0003,021,0002,392,064