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 16:38highload-churnerhighload-churnerScore: 55,113Success
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 16:3954,97829,241,34020,342,000020,480
2Oct 11, 2026 16:3955,02129,201,07920,358,000020,480
3Oct 11, 2026 16:3955,05929,223,20720,372,000020,480
4Oct 11, 2026 16:3955,11029,269,64520,391,000020,480
5Oct 11, 2026 16:3955,11329,243,51120,392,000020,480
6Oct 11, 2026 16:3955,20829,334,33420,427,000020,480
7Oct 11, 2026 16:3955,34029,354,79220,476,000020,480
8Oct 11, 2026 16:3955,36729,353,13920,486,000020,480
9Oct 11, 2026 16:3955,46229,264,96020,521,000020,480