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 13:30Yuriy LyfenkoYuriy LyfenkoScore: 107,678Success
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 13:30107,02267,512,02738,583,0001,015,0002,334,720
2Jul 13, 2021 13:30107,08668,326,73537,591,0002,031,0002,326,528
3Jul 13, 2021 13:30107,09766,040,72838,610,0001,016,0002,523,136
4Jul 13, 2021 13:30107,18465,970,36338,642,0001,016,0002,519,040
5Jul 13, 2021 13:30107,31966,227,57538,690,0001,018,0002,334,720
6Jul 13, 2021 13:30107,65166,215,68636,844,0002,987,0002,334,720
7Jul 13, 2021 13:30107,67866,676,31338,845,000996,0002,514,944
8Jul 13, 2021 13:30107,73575,783,86736,873,0002,989,0002,519,040
9Jul 13, 2021 13:30107,75471,710,43938,847,0001,022,0002,334,720
10Jul 13, 2021 13:30109,796109,972,17040,624,63002,183,168
11Jul 13, 2021 13:30109,893103,006,58040,660,51402,183,168
12Jul 13, 2021 13:30110,39792,134,27440,847,06302,187,264