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 14:57Yuriy LyfenkoYuriy LyfenkoScore: 108,219Success
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 14:57107,64166,557,47937,836,0001,991,0002,514,944
2Jul 13, 2021 14:57107,73865,339,48637,870,0001,993,0002,322,432
3Jul 13, 2021 14:57107,85163,454,67937,910,0001,995,0002,519,040
4Jul 13, 2021 14:57108,00567,593,73637,964,0001,998,0002,322,432
5Jul 13, 2021 14:57108,01170,296,84836,967,0002,997,0002,334,720
6Jul 13, 2021 14:57108,11465,868,18038,002,0002,000,0002,523,136
7Jul 13, 2021 14:57108,21970,810,76637,038,0003,003,0002,527,232
8Jul 13, 2021 14:57108,52467,265,75638,147,0002,007,0002,334,720
9Jul 13, 2021 14:57108,82262,941,45037,245,0003,019,0002,523,136
10Jul 13, 2021 14:57109,840106,767,42740,640,70802,179,072
11Jul 13, 2021 14:57110,017108,724,77340,706,35902,179,072
12Jul 13, 2021 14:57110,653102,597,53940,941,58602,187,264