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:01Andrey TsvetkovAndrey TsvetkovScore: 96,359Success
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:0195,35159,137,17433,264,0002,016,0002,334,720
2Jul 13, 2021 11:0195,52257,101,38732,314,0003,029,0002,519,040
3Jul 13, 2021 11:0195,66559,459,92634,385,0001,011,0002,506,752
4Jul 13, 2021 11:0195,79263,317,93233,418,0002,025,0002,531,328
5Jul 13, 2021 11:0195,88660,849,99534,465,0001,013,0002,334,720
6Jul 13, 2021 11:0196,13064,053,88533,536,0002,032,0002,531,328
7Jul 13, 2021 11:0196,35968,849,71933,616,0002,037,0002,527,232
8Jul 13, 2021 11:0196,40061,482,54933,630,0002,038,0002,527,232
9Jul 13, 2021 11:0196,93063,136,04533,872,0001,992,0002,519,040
10Jul 13, 2021 11:0199,04098,615,17436,644,63602,199,552
11Jul 13, 2021 11:0199,185105,822,86536,698,41902,199,552
12Jul 13, 2021 11:0199,584113,414,29236,846,23302,199,552