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 listSep 11, 2021 07:25Sergey StreminSergey StreminError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 07:2500000Error: Exit with code 101: vec len 12 thread 'main' panicked at 'slice index starts at 18446744073709551528 but ends at 12', main.rs:24:15 note: run with `RUST_BACKTRACE=1` environment variable to display a backtracestderr