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 15, 2026 19:50Elijah KinElijah KinScore: 214,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:50213,757106,840,31742,048,00037,042,0002,318,336
2Mar 15, 2026 19:50214,276107,189,64542,150,00037,132,0002,318,336
3Mar 15, 2026 19:50216,670107,913,30732,067,00048,101,0002,273,280