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 12, 2021 21:37piculpiculScore: 358,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2021 21:37350,587194,931,632129,717,30102,240,512
2Sep 12, 2021 21:37358,314203,536,259132,576,22502,301,952
3Sep 12, 2021 21:37390,958209,800,357144,654,62002,285,568