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:03Elijah KinElijah KinScore: 510,195Success
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:03508,276214,095,901136,045,00052,017,0002,502,656
2Mar 15, 2026 19:03510,195212,646,273147,822,00040,950,0002,285,568
3Mar 15, 2026 19:03522,322218,389,652154,207,00039,052,0002,502,656