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 26, 2026 20:46TudyMTudyMScore: 125,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 20:46124,54363,167,61944,078,0002,003,0002,297,856
2Apr 26, 2026 20:46124,81666,212,83745,179,0001,003,0002,306,048
3Apr 26, 2026 20:46124,88363,613,81043,194,0003,013,0002,363,392
4Apr 26, 2026 20:46124,99767,910,08246,249,00002,371,584
5Apr 26, 2026 20:46125,18665,808,87645,313,0001,006,0002,289,664
6Apr 26, 2026 20:46125,26266,629,63745,340,0001,007,0002,375,680
7Apr 26, 2026 20:46125,27264,223,52144,336,0002,015,0002,379,776
8Apr 26, 2026 20:46125,44361,409,56345,405,0001,009,0002,363,392
9Apr 26, 2026 20:46126,29765,863,08644,742,0001,988,0002,363,392