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:34Haha ExpertHaha ExpertScore: 85,978Success
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:3585,62141,571,97230,630,0001,050,0002,117,632
2Sep 12, 2026 09:3585,67040,307,88830,679,0001,019,0002,117,632
3Sep 12, 2026 09:3585,68141,157,08430,672,0001,030,0002,117,632
4Sep 12, 2026 09:3585,96740,491,12330,774,0001,034,0002,117,632
5Sep 12, 2026 09:3585,97841,256,12430,787,0001,025,0002,117,632
6Sep 12, 2026 09:3586,01840,437,27530,799,0001,028,0002,117,632
7Sep 12, 2026 09:3586,64540,650,35431,035,0001,024,0002,117,632
8Sep 12, 2026 09:3586,66441,469,14231,046,0001,020,0002,117,632
9Sep 12, 2026 09:3586,67240,540,84031,045,0001,024,0002,117,632