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 24, 2026 18:56Kevin HeaveyKevin HeaveyScore: 54,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 18:5654,02428,842,16519,989,000020,480
2Sep 24, 2026 18:5654,10528,852,87320,019,000020,480
3Sep 24, 2026 18:5654,17028,842,01120,043,000020,480