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 9, 2026 13:17highload-churnerhighload-churnerScore: 69,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 13:1869,48634,548,71624,696,0001,014,00020,480
2Oct 9, 2026 13:1869,56234,583,97824,729,0001,009,00020,480
3Oct 9, 2026 13:1873,20544,852,80326,010,0001,076,00020,480