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 listMay 7, 2024 23:30Joad NacerJoad NacerScore: 68,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 23:3068,44395,957,90525,323,87402,281,472
2May 7, 2024 23:3068,68193,384,00025,412,11402,265,088
3May 7, 2024 23:3068,75389,648,84925,438,56202,269,184