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 12, 2026 15:37highload-churnerhighload-churnerScore: 54,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 15:3854,83529,201,25420,289,000020,480
2Oct 12, 2026 15:3854,90829,183,57020,316,000020,480
3Oct 12, 2026 15:3854,93529,258,98320,326,000020,480
4Oct 12, 2026 15:3854,93729,110,09320,327,000020,480
5Oct 12, 2026 15:3854,99129,089,95920,347,000020,480
6Oct 12, 2026 15:3854,99729,215,68420,349,000020,480
7Oct 12, 2026 15:3855,10029,941,41020,387,000020,480
8Oct 12, 2026 15:3855,15429,166,65120,407,000020,480
9Oct 12, 2026 15:3855,24329,191,81320,440,000020,480