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:42highload-churnerhighload-churnerScore: 54,983Success
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:4354,775129,207,48420,267,000020,480
2Oct 12, 2026 14:4354,797129,157,46420,275,000020,480
3Oct 12, 2026 14:4354,940129,309,06620,328,000020,480
4Oct 12, 2026 14:4354,940129,139,28820,328,000020,480
5Oct 12, 2026 14:4354,983129,370,31520,344,000020,480
6Oct 12, 2026 14:4355,040129,387,00120,365,000020,480
7Oct 12, 2026 14:4355,137129,730,23220,401,000020,480
8Oct 12, 2026 14:4355,221129,442,37020,432,000020,480
9Oct 12, 2026 14:4357,283140,180,26721,195,000020,480