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 listOct 25, 2022 01:25Kenneth MaplesKenneth MaplesScore: 73,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2022 01:2573,16854,483,63425,067,0002,005,0002,502,656
2Oct 25, 2022 01:2573,22253,266,91125,086,0002,006,0002,502,656
3Oct 25, 2022 01:2573,30548,893,49925,114,0002,009,0002,498,560
4Oct 25, 2022 01:2573,31950,572,00625,119,0002,009,0002,289,664
5Oct 25, 2022 01:2573,38652,252,51325,142,0002,011,0002,289,664
6Oct 25, 2022 01:2573,39550,936,80826,151,0001,005,0002,289,664
7Oct 25, 2022 01:2573,48652,384,83925,176,0002,014,0002,289,664
8Oct 25, 2022 01:2573,68450,374,92725,244,0002,019,0002,289,664
9Oct 25, 2022 01:2573,94148,998,08925,332,0002,026,0002,289,664
10Oct 25, 2022 01:2576,69899,642,71228,378,34202,224,128
11Oct 25, 2022 01:2577,09887,902,15428,526,31402,256,896
12Oct 25, 2022 01:2577,18589,179,62128,558,38602,224,128