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 12, 2025 07:17Oleg KovalovOleg KovalovScore: 498,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2025 07:17498,154207,168,844181,312,0003,005,0002,330,624
2Mar 12, 2025 07:17498,554206,254,940182,460,0002,005,0002,330,624
3Mar 12, 2025 07:17499,468213,682,081183,805,000998,0002,330,624