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 listSep 15, 2021 20:12piculpiculScore: 72,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 20:1271,90353,168,17625,581,0001,023,0002,281,472
2Sep 15, 2021 20:1272,07657,555,42625,643,0001,025,0002,523,136
3Sep 15, 2021 20:1272,08154,654,67025,645,0001,025,0002,281,472
4Sep 15, 2021 20:1272,10052,649,73526,677,00002,289,664
5Sep 15, 2021 20:1272,53053,755,01025,843,000993,0002,367,488
6Sep 15, 2021 20:1272,53853,856,04425,845,000994,0002,531,328
7Sep 15, 2021 20:1272,59758,682,44524,872,0001,989,0002,273,280
8Sep 15, 2021 20:1272,60054,503,01024,873,0001,989,0002,289,664
9Sep 15, 2021 20:1272,61458,906,38724,877,0001,990,0002,289,664
10Sep 15, 2021 20:1275,28897,379,14727,856,50302,256,896
11Sep 15, 2021 20:1275,562101,434,50727,958,03602,265,088
12Sep 15, 2021 20:1275,67292,761,80927,998,65602,269,184