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 30, 2026 04:36limanjun99limanjun99Score: 68,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 04:3668,27849,485,82624,253,0001,010,0002,281,472
2Mar 30, 2026 04:3668,61953,169,45923,358,0002,031,0002,396,160
3Mar 30, 2026 04:3670,03247,616,04523,919,0001,993,0002,404,352