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 listApr 19, 2026 08:54olliecrowolliecrowScore: 62,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 08:5462,38948,890,64322,081,0001,003,0002,293,760
2Apr 19, 2026 08:5462,43050,211,84921,091,0002,008,0002,523,136
3Apr 19, 2026 08:5462,56853,686,91121,137,0002,013,0002,506,752