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 18:04Yuriy LyfenkoYuriy LyfenkoScore: 61,522Success
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 18:0461,132546,834,57521,591,0001,028,0002,281,472
2Sep 15, 2021 18:0461,176549,117,99821,607,0001,028,0002,281,472
3Sep 15, 2021 18:0461,205551,033,36820,588,0002,058,0002,289,664
4Sep 15, 2021 18:0461,422549,389,08521,738,000988,0002,289,664
5Sep 15, 2021 18:0461,505548,779,88120,779,0001,978,0002,281,472
6Sep 15, 2021 18:0461,514546,588,24020,781,0001,979,0002,281,472
7Sep 15, 2021 18:0461,522552,023,71620,784,0001,979,0002,281,472
8Sep 15, 2021 18:0461,535552,263,99221,779,000989,0002,281,472
9Sep 15, 2021 18:0461,549553,504,71721,783,000990,0002,281,472
10Sep 15, 2021 18:0464,209576,498,80423,757,50402,248,704
11Sep 15, 2021 18:0464,283581,080,35123,784,64502,248,704
12Sep 15, 2021 18:0464,900587,957,15324,012,85102,252,800