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 21, 2026 15:28izotoffizotoffScore: 115,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 15:28115,17870,903,83242,616,00002,322,432
2Mar 21, 2026 15:28115,79571,588,35542,844,00002,342,912
3Mar 21, 2026 15:28116,58170,905,82740,126,0003,009,0002,326,528