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 7, 2021 21:47Mikhail DektyarevMikhail DektyarevScore: 1,288,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 21:471,076,914869,201,291398,458,327064,282,624
2Jul 7, 2021 21:471,081,893882,535,173400,300,269060,882,944
3Jul 7, 2021 21:471,083,117899,320,299400,753,188062,312,448
4Jul 7, 2021 21:471,288,171538,647,714476,623,37602,293,760
5Jul 7, 2021 21:471,680,975704,362,506621,960,87202,277,376
6Jul 7, 2021 21:472,196,788875,283,493812,811,71202,277,376