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 26, 2024 23:48Joad NacerJoad NacerScore: 71,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2024 23:4871,030102,606,06126,281,23202,277,376
2May 26, 2024 23:4871,062104,357,46326,293,11502,252,800
3May 26, 2024 23:4871,45788,714,93026,439,19602,265,088