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 14, 2021 14:03Yuriy LyfenkoYuriy LyfenkoScore: 88,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 14:0387,041555,648,53829,186,0003,019,0002,523,136
2Jul 14, 2021 14:0387,857564,775,64631,492,0001,015,0002,502,656
3Jul 14, 2021 14:0388,055601,283,14832,580,36502,179,072
4Jul 14, 2021 14:0388,146568,782,21830,576,0002,038,0002,330,624
5Jul 14, 2021 14:0388,462558,861,56831,740,000991,0002,330,624
6Jul 14, 2021 14:0388,543565,354,06330,776,0001,985,0002,326,528
7Jul 14, 2021 14:0388,570561,845,00830,785,0001,986,0002,326,528
8Jul 14, 2021 14:0388,605560,152,89030,798,0001,986,0002,326,528
9Jul 14, 2021 14:0388,632561,287,87730,807,0001,987,0002,326,528
10Jul 14, 2021 14:0388,902584,945,48232,893,58802,248,704
11Jul 14, 2021 14:0388,922561,354,63129,910,0002,991,0002,514,944
12Jul 14, 2021 14:0389,006594,840,44932,932,12302,252,800