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 11, 2021 07:22Sergey StreminSergey StreminScore: 96,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 07:2295,27857,951,30034,246,0001,007,0002,273,280
2Sep 11, 2021 07:2295,62456,939,40034,371,0001,010,0002,486,272
3Sep 11, 2021 07:2295,63061,699,59235,383,00002,490,368
4Sep 11, 2021 07:2295,73864,305,91034,411,0001,012,0002,277,376
5Sep 11, 2021 07:2295,84957,103,52435,464,00002,473,984
6Sep 11, 2021 07:2295,90357,797,90734,471,0001,013,0002,539,520
7Sep 11, 2021 07:2296,14661,890,44834,558,0001,016,0002,482,176
8Sep 11, 2021 07:2296,34964,072,17134,631,0001,018,0002,314,240
9Sep 11, 2021 07:2296,50865,824,65534,717,000991,0002,486,272
10Sep 11, 2021 07:2297,996125,501,68136,258,64602,195,456
11Sep 11, 2021 07:2298,440100,537,05336,422,78102,191,360
12Sep 11, 2021 07:2299,399105,147,80536,777,80402,195,456