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:35Ian MckibbenIan MckibbenScore: 71,154Success
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:3570,73251,200,74325,165,0001,006,0002,424,832
2Jan 19, 2025 09:3571,15452,476,92826,327,00002,531,328
3Jan 19, 2025 09:3571,36553,338,75326,405,00002,433,024