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 11, 2026 22:35highload-churnerhighload-churnerScore: 55,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 22:3554,93529,264,51820,326,000020,480
2Oct 11, 2026 22:3554,96229,228,71020,336,000020,480
3Oct 11, 2026 22:3555,01329,272,38520,355,000020,480
4Oct 11, 2026 22:3555,05129,261,85220,369,000020,480
5Oct 11, 2026 22:3555,06429,214,89520,374,000020,480
6Oct 11, 2026 22:3555,13529,286,65520,400,000020,480
7Oct 11, 2026 22:3555,15629,398,73420,408,000020,480
8Oct 11, 2026 22:3555,20029,342,39520,424,000020,480
9Oct 11, 2026 22:3555,20229,217,37520,425,000020,480