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 6, 2022 15:14Eugene ZhydzetskiEugene ZhydzetskiScore: 161,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2022 15:14161,216125,636,51359,649,86802,191,360
2Sep 6, 2022 15:14161,613116,989,06659,796,71602,191,360
3Sep 6, 2022 15:14161,678122,504,06259,820,68402,199,552