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:51limanjun99limanjun99Score: 58,235Success
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:5158,15747,291,50721,518,00002,392,064
2Mar 30, 2026 05:5158,23547,846,07320,521,0001,026,0002,486,272
3Mar 30, 2026 05:5162,70847,444,07722,194,0001,008,0002,281,472