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:30Ian MckibbenIan MckibbenScore: 75,546Success
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:3075,32253,991,28425,879,0001,990,0002,269,184
2Jan 19, 2025 07:3075,54650,404,31926,954,000998,0002,437,120
3Jan 19, 2025 07:3075,79253,005,45226,040,0002,003,0002,531,328