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 25, 2025 00:52Ian MckibbenIan MckibbenScore: 70,041Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 00:5269,96555,636,01925,887,00002,269,184
2Jan 25, 2025 00:5270,04146,483,01924,919,000996,0002,531,328
3Jan 25, 2025 00:5270,25753,486,96623,996,0001,999,0002,269,184