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:40limanjun99limanjun99Score: 63,981Success
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:4063,97048,511,90423,669,00002,281,472
2Mar 30, 2026 05:4063,98151,015,49823,673,00002,396,160
3Mar 30, 2026 05:4064,05447,433,33823,700,00002,281,472