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:33Joad NacerJoad NacerError
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:3300000Error: expected "429496511079 ", got "26057359797 "
2May 7, 2024 23:3400000Error: expected "429496493912 ", got "71090288368 "
3May 7, 2024 23:3400000Error: expected "429496559388 ", got "111831256772 "
4May 7, 2024 23:3400000Error: expected "429496484235 ", got "77128399743 "
5May 7, 2024 23:3500000Error: expected "429496519017 ", got "200681470570 "
6May 7, 2024 23:3500000Error: expected "429496556344 ", got "48440129799 "
7May 7, 2024 23:3500000Error: expected "429496561193 ", got "147210090707 "
8May 7, 2024 23:3500000Error: expected "429496575719 ", got "115497995794 "
9May 7, 2024 23:3700000Error: expected "429496525907 ", got "39644476806 "
10May 7, 2024 23:3700000Error: expected "429496489493 ", got "96721941514 "