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 listJan 17, 2025 05:51Ian MckibbenIan MckibbenError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 05:5100000Error: expected "429496521024 ", got "483263192 1766173239 4295637252009189062 5046979872484479892 3605812727446125116 3615521084610181375 2075599605483832024 2075599605483832024 2075599605483832024 2075599605483832024 -1 "