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:30Haha ExpertHaha ExpertScore: 77,651Success
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:3177,35137,222,89127,594,0001,026,0002,117,632
2Sep 12, 2026 09:3177,36237,509,70027,595,0001,029,0002,117,632
3Sep 12, 2026 09:3177,39738,087,37227,605,0001,032,0002,117,632
4Sep 12, 2026 09:3177,64538,028,87827,685,0001,044,0002,117,632
5Sep 12, 2026 09:3177,65137,335,48027,691,0001,040,0002,117,632
6Sep 12, 2026 09:3177,66738,287,25527,710,0001,027,0002,117,632
7Sep 12, 2026 09:3178,19737,756,60227,902,0001,031,0002,117,632
8Sep 12, 2026 09:3178,24338,390,59427,920,0001,030,0002,117,632
9Sep 12, 2026 09:3179,00038,774,11228,174,0001,056,0002,117,632