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 listJul 13, 2021 11:37SerVerXPlanetSerVerXPlanetScore: 206,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 11:37205,520140,603,61876,042,58302,285,568
2Jul 13, 2021 11:37206,566149,026,39676,429,26802,293,760
3Jul 13, 2021 11:37206,634137,746,93076,454,73502,297,856