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 14:53highload-churnerhighload-churnerScore: 55,229Success
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 14:5455,03529,237,11820,363,000020,480
2Oct 12, 2026 14:5455,10230,696,75820,388,000020,480
3Oct 12, 2026 14:5455,20029,423,43120,424,000020,480
4Oct 12, 2026 14:5455,22429,315,28720,433,000020,480
5Oct 12, 2026 14:5455,22929,131,46520,435,000020,480
6Oct 12, 2026 14:5455,24529,327,26120,441,000020,480
7Oct 12, 2026 14:5455,24829,357,59920,442,000020,480
8Oct 12, 2026 14:5455,32730,651,72820,471,000020,480
9Oct 12, 2026 14:5455,39431,086,61920,496,000020,480