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 listSep 12, 2026 09:25Haha ExpertHaha ExpertScore: 91,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 09:2690,92443,123,33732,625,0001,017,0002,117,632
2Sep 12, 2026 09:2690,93243,083,05232,635,0001,010,0002,117,632
3Sep 12, 2026 09:2690,98342,265,68632,622,0001,042,0002,117,632
4Sep 12, 2026 09:2691,22943,927,44132,723,0001,032,0002,117,632
5Sep 12, 2026 09:2691,31343,259,62432,765,0001,021,0002,117,632
6Sep 12, 2026 09:2691,37244,473,50532,785,0001,023,0002,117,632
7Sep 12, 2026 09:2691,90543,476,45332,969,0001,036,0002,117,632
8Sep 12, 2026 09:2691,92742,632,41832,975,0001,038,0002,117,632
9Sep 12, 2026 09:2692,02942,690,32933,024,0001,027,0002,117,632