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 5, 2022 19:39Eugene ZhydzetskiEugene ZhydzetskiScore: 211,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2022 19:39211,545143,751,52678,271,49002,195,456
2Sep 5, 2022 19:39211,716143,900,53878,334,83802,199,552
3Sep 5, 2022 19:39212,027136,080,07478,450,06202,211,840