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 23:14highload-churnerhighload-churnerScore: 56,213Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 00:5656,12729,727,06720,767,000020,480
2Oct 10, 2026 00:5656,18129,898,90620,787,000020,480
3Oct 10, 2026 00:5656,20229,831,69020,795,000020,480
4Oct 10, 2026 00:5656,20529,744,29120,796,000020,480
5Oct 10, 2026 00:5656,21331,122,58220,799,000020,480
6Oct 10, 2026 00:5656,24329,827,79320,810,000020,480
7Oct 10, 2026 00:5656,28929,784,93520,827,000020,480
8Oct 10, 2026 00:5656,33229,885,38320,843,000020,480
9Oct 10, 2026 00:5656,35429,883,52320,851,000020,480