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 16, 2026 22:35izotoffizotoffScore: 139,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:35138,42470,742,25748,205,0003,012,0002,396,160
2Mar 16, 2026 22:35139,01673,732,19750,428,0001,008,0002,396,160
3Mar 16, 2026 22:35139,38981,717,94551,574,00002,314,240