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 21:17highload-churnerhighload-churnerScore: 63,472Success
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 21:2863,29132,958,72723,418,000020,480
2Oct 9, 2026 21:2863,31832,478,64523,428,000020,480
3Oct 9, 2026 21:2863,40533,032,43823,460,000020,480
4Oct 9, 2026 21:2863,41333,063,48123,463,000020,480
5Oct 9, 2026 21:2863,47232,501,77223,485,000020,480
6Oct 9, 2026 21:2863,52733,080,18923,505,000020,480
7Oct 9, 2026 21:2863,71334,994,45823,574,000020,480
8Oct 9, 2026 21:2863,76232,605,55523,592,000020,480
9Oct 9, 2026 21:2863,84033,122,81823,621,000020,480