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:40e1011e1011Score: 83,410Success
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:4281,71041,080,42729,128,0001,105,0002,113,536
2Oct 20, 2026 07:4282,32441,313,43929,364,0001,096,0002,113,536
3Oct 20, 2026 07:4282,68341,784,72229,394,0001,199,0002,113,536
4Oct 20, 2026 07:4283,33741,710,14729,738,0001,097,0002,113,536
5Oct 20, 2026 07:4283,41041,939,30629,670,0001,192,0002,113,536
6Oct 20, 2026 07:4283,66241,893,83629,769,0001,186,0002,113,536
7Oct 20, 2026 07:4283,68341,878,84029,849,0001,114,0002,113,536
8Oct 20, 2026 07:4283,88642,459,72229,837,0001,201,0002,113,536
9Oct 20, 2026 07:4293,46446,082,99833,360,0001,222,0002,113,536