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 23, 2025 01:18Ian MckibbenIan MckibbenScore: 70,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 23, 2025 01:1869,92451,748,58624,877,000995,0002,531,328
2Jan 23, 2025 01:1870,15446,492,02824,959,000998,0002,437,120
3Jan 23, 2025 01:1873,87853,469,94325,311,0002,024,0002,437,120