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 28, 2023 17:00mmalczakmmalczakScore: 73,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 17:0073,427109,134,41727,167,97302,269,184
2Sep 28, 2023 17:0073,53286,942,86927,206,95902,281,472
3Sep 28, 2023 17:0073,55187,300,09227,213,94902,277,376