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:39izotoffizotoffScore: 139,705Success
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:39139,51683,265,12051,621,00002,314,240
2Mar 16, 2026 22:39139,70576,410,84948,651,0003,040,0002,314,240
3Mar 16, 2026 22:39140,09279,240,67450,838,000996,0002,314,240