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 16, 2021 10:23Mikhail ShirokovMikhail ShirokovScore: 106,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2021 10:23105,71166,739,44136,105,0003,008,0002,519,040
2Sep 16, 2021 10:23105,89565,384,72038,177,0001,004,0002,519,040
3Sep 16, 2021 10:23105,91471,801,42537,179,0002,009,0002,519,040
4Sep 16, 2021 10:23106,38663,452,49938,354,0001,009,0002,387,968
5Sep 16, 2021 10:23106,58670,660,59439,437,00002,519,040
6Sep 16, 2021 10:23106,69561,297,29039,477,00002,392,064
7Sep 16, 2021 10:23106,88166,860,03939,546,00002,383,872
8Sep 16, 2021 10:23107,05965,218,51938,597,0001,015,0002,519,040
9Sep 16, 2021 10:23107,88667,557,67237,923,0001,995,0002,519,040
10Sep 16, 2021 10:23108,933117,572,10240,305,06102,248,704
11Sep 16, 2021 10:23109,566104,702,68740,539,42002,252,800
12Sep 16, 2021 10:23109,682123,035,36640,582,37202,252,800