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 22, 2025 02:13Ian MckibbenIan MckibbenScore: 746,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 02:13460,362194,326,598170,334,00002,433,024
2Jan 22, 2025 02:13746,995300,358,947276,388,00002,527,232
3Jan 22, 2025 02:13779,192309,275,355287,300,0001,001,0002,437,120