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 07:10Ian MckibbenIan MckibbenScore: 84,078Success
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 07:1084,01458,758,25930,083,0001,002,0002,531,328
2Jan 19, 2025 07:1084,07854,294,57330,106,0001,003,0002,269,184
3Jan 19, 2025 07:1084,47854,458,25430,249,0001,008,0002,437,120