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 listJun 12, 2026 01:57Victor MerckléVictor MerckléScore: 66,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 02:0166,36433,614,30123,388,0001,167,0002,134,016
2Jun 12, 2026 02:0166,54533,651,28223,473,0001,149,0002,129,920
3Jun 12, 2026 02:0166,62133,628,58923,505,0001,145,0002,129,920
4Jun 12, 2026 02:0166,68333,698,04423,523,0001,150,0002,134,016
5Jun 12, 2026 02:0166,77833,580,04223,539,0001,169,0002,134,016
6Jun 12, 2026 02:0166,81833,663,12823,573,0001,150,0002,129,920
7Jun 12, 2026 02:0166,82933,756,98323,575,0001,152,0002,134,016
8Jun 12, 2026 02:0167,21033,812,29523,730,0001,138,0002,129,920
9Jun 12, 2026 02:0167,28633,891,57623,744,0001,152,0002,174,976