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 17, 2025 00:34Ian MckibbenIan MckibbenScore: 140,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 00:34140,42479,676,82449,959,0001,998,0002,289,664
2Jan 17, 2025 00:34140,88177,273,70450,122,0002,004,0002,289,664
3Jan 17, 2025 00:34141,01674,853,42650,170,0002,006,0002,277,376