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 22:13highload-churnerhighload-churnerScore: 56,437Success
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 23:1756,21029,852,34520,798,000020,480
2Oct 9, 2026 23:1756,25129,820,79320,813,000020,480
3Oct 9, 2026 23:1756,34529,809,86420,848,000020,480
4Oct 9, 2026 23:1756,39429,800,85920,866,000020,480
5Oct 9, 2026 23:1756,43729,833,85720,882,000020,480
6Oct 9, 2026 23:1756,47029,930,50920,894,000020,480
7Oct 9, 2026 23:1756,52929,973,20020,916,000020,480
8Oct 9, 2026 23:1756,52929,947,16020,916,000020,480
9Oct 9, 2026 23:1756,54029,836,57220,920,000020,480