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 20, 2026 17:01olliecrowolliecrowScore: 101,295Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 17:01100,95462,342,27735,334,0002,019,0002,306,048
2Mar 20, 2026 17:01101,29559,000,46435,454,0002,025,0002,441,216
3Mar 20, 2026 17:01102,60868,568,27334,968,0002,997,0002,342,912