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 listApr 12, 2025 23:17barronweibarronweiError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2025 23:1700000Error: Exit with code 101: thread 'main' panicked at main.rs:7:29: range end index 10 out of range for slice of length 0 note: run with `RUST_BACKTRACE=1` environment variable to display a backtracestderr