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 19, 2025 09:42Ian MckibbenIan MckibbenScore: 70,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 09:4270,53848,321,17724,092,0002,007,0002,437,120
2Jan 19, 2025 09:4270,97352,652,01725,250,0001,010,0002,428,928
3Jan 19, 2025 09:4271,38148,699,29425,396,0001,015,0002,510,848