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:04Mikhail ShirokovMikhail ShirokovScore: 106,724Success
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:04105,54963,648,58936,049,0003,004,0002,519,040
2Sep 16, 2021 10:04105,65465,348,18139,092,00002,392,064
3Sep 16, 2021 10:04105,84366,261,29438,158,0001,004,0002,519,040
4Sep 16, 2021 10:04105,92272,669,52036,177,0003,014,0002,387,968
5Sep 16, 2021 10:04105,95167,439,40438,197,0001,005,0002,387,968
6Sep 16, 2021 10:04106,42461,569,33738,368,0001,009,0002,387,968
7Sep 16, 2021 10:04106,72463,431,24038,476,0001,012,0002,519,040
8Sep 16, 2021 10:04106,90565,557,99537,527,0002,028,0002,519,040
9Sep 16, 2021 10:04107,03566,173,06838,588,0001,015,0002,519,040
10Sep 16, 2021 10:04109,180108,509,68340,396,71402,244,608
11Sep 16, 2021 10:04109,744114,343,76840,605,20302,199,552
12Sep 16, 2021 10:04109,914109,508,07340,668,32702,248,704