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 25, 2025 00:32Ian MckibbenIan MckibbenScore: 70,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 00:3270,62247,763,73124,120,0002,010,0002,428,928
2Jan 25, 2025 00:3270,62446,556,62825,126,0001,005,0002,269,184
3Jan 25, 2025 00:3271,37054,822,14325,392,0001,015,0002,433,024