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:03highload-churnerhighload-churnerScore: 55,240Success
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:0355,13529,325,41320,400,000020,480
2Oct 11, 2026 16:0355,17829,232,42020,416,000020,480
3Oct 11, 2026 16:0355,20029,217,10220,424,000020,480
4Oct 11, 2026 16:0355,20529,238,65720,426,000020,480
5Oct 11, 2026 16:0355,24029,286,21720,439,000020,480
6Oct 11, 2026 16:0355,31831,979,86120,468,000020,480
7Oct 11, 2026 16:0355,34529,248,53120,478,000020,480
8Oct 11, 2026 16:0355,39129,325,69820,495,000020,480
9Oct 11, 2026 16:0355,60029,300,32220,572,000020,480