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:19Ian MckibbenIan MckibbenScore: 71,003Success
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:1970,57852,854,08925,110,0001,004,0002,437,120
2Jan 19, 2025 09:1971,00346,021,24425,261,0001,010,0002,531,328
3Jan 19, 2025 09:1971,42750,979,82926,428,00002,531,328