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 listOct 20, 2026 07:31e1011e1011Score: 84,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 07:3283,18341,652,09929,676,0001,102,0002,113,536
2Oct 20, 2026 07:3283,62741,797,61329,840,0001,102,0002,113,536
3Oct 20, 2026 07:3283,88142,435,97729,840,0001,196,0002,113,536
4Oct 20, 2026 07:3284,11342,549,01329,940,0001,182,0002,113,536
5Oct 20, 2026 07:3284,19142,545,34329,955,0001,196,0002,113,536
6Oct 20, 2026 07:3294,78345,938,35833,957,0001,113,0002,113,536
7Oct 20, 2026 07:3295,08146,374,57733,984,0001,196,0002,113,536
8Oct 20, 2026 07:3295,36246,392,34934,053,0001,231,0002,113,536
9Oct 20, 2026 07:3295,43746,500,65034,079,0001,233,0002,113,536