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 2, 2026 13:33C21C21Score: 68,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 13:3366,10035,067,89423,372,0001,085,0002,117,632stderr
2Oct 2, 2026 13:3368,08635,826,83424,111,0001,081,0002,117,632stderr
3Oct 2, 2026 13:3368,44335,964,39924,239,0001,085,0002,117,632stderr