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:03mmalczakmmalczakScore: 73,161Success
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:0373,01281,735,50227,014,35602,277,376
2Sep 28, 2023 17:0373,16191,023,13727,069,64702,277,376
3Sep 28, 2023 17:0374,09488,969,88527,414,85802,277,376