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 listMay 17, 2026 11:47M-RochatM-RochatScore: 62,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 11:4961,94031,742,04721,872,0001,046,0002,113,536
2May 17, 2026 11:4962,05632,447,19221,946,0001,015,0002,113,536
3May 17, 2026 11:4962,22432,892,06222,011,0001,012,0002,113,536
4May 17, 2026 11:4962,27232,870,94022,004,0001,037,0002,113,536
5May 17, 2026 11:4962,31033,842,25922,045,0001,010,0002,113,536
6May 17, 2026 11:4962,36432,432,99422,057,0001,018,0002,113,536
7May 17, 2026 11:4962,57832,087,55622,147,0001,007,0002,113,536
8May 17, 2026 11:4962,69431,990,00422,163,0001,034,0002,113,536
9May 17, 2026 11:4962,97533,844,48922,290,0001,011,0002,113,536