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 listSep 20, 2026 15:20Andrew EpsteinAndrew EpsteinScore: 55,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 15:2355,87529,486,06520,674,000020,480
2Sep 20, 2026 15:2355,88129,435,08320,676,000020,480
3Sep 20, 2026 15:2355,89129,489,55120,680,000020,480
4Sep 20, 2026 15:2355,96229,443,88520,706,000020,480
5Sep 20, 2026 15:2355,97829,496,01120,712,000020,480
6Sep 20, 2026 15:2355,98331,098,85520,714,000020,480
7Sep 20, 2026 15:2356,13231,300,81520,769,000020,480
8Sep 20, 2026 15:2356,19729,595,33820,793,000020,480
9Sep 20, 2026 15:2356,27529,679,80920,822,000020,480