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 05:14limanjun99limanjun99Score: 62,086Success
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 05:1461,87645,969,85222,894,00002,396,160
2Mar 30, 2026 05:1462,08646,280,86320,975,0001,997,0002,281,472
3Mar 30, 2026 05:1465,43851,723,45223,204,0001,008,0002,404,352