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 19, 2026 13:27Andrew EpsteinAndrew EpsteinScore: 91,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 13:3691,56444,081,72928,693,0005,186,0002,129,920stderr
2Sep 19, 2026 13:3691,56744,047,05928,677,0005,203,0002,129,920stderr
3Sep 19, 2026 13:3691,58344,092,39828,677,0005,209,0002,129,920stderr
4Sep 19, 2026 13:3691,66445,541,13428,719,0005,197,0002,129,920stderr
5Sep 19, 2026 13:3691,66744,146,32628,710,0005,207,0002,129,920stderr
6Sep 19, 2026 13:3691,72744,018,19828,734,0005,205,0002,129,920stderr
7Sep 19, 2026 13:3691,85644,300,96828,790,0005,197,0002,129,920stderr
8Sep 19, 2026 13:3691,92444,204,61528,816,0005,196,0002,129,920stderr
9Sep 19, 2026 13:3692,03244,279,91328,773,0005,279,0002,129,920stderr