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 19, 2026 05:01izotoffizotoffError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 05:06039,642,24926,053,0002,138,0002,138,112expected "429496475381 ", got "386546850814 "
2Oct 19, 2026 05:0674,34536,838,79625,466,0002,042,0002,142,208stderr
3Oct 19, 2026 05:0675,81037,379,80525,932,0002,118,0002,142,208stderr