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 16:04piculpiculScore: 109,589Success
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 16:04105,84363,805,73137,154,0002,008,0002,289,664
2Sep 15, 2021 16:04106,87664,218,67338,531,0001,013,0002,289,664
3Sep 15, 2021 16:04107,07363,953,86438,602,0001,015,0002,289,664
4Sep 15, 2021 16:04108,24664,013,96138,049,0002,002,0002,289,664
5Sep 15, 2021 16:04108,79270,050,74539,247,0001,006,0002,289,664
6Sep 15, 2021 16:04109,31662,169,27940,447,00002,289,664
7Sep 15, 2021 16:04109,58969,812,53639,535,0001,013,0002,269,184
8Sep 15, 2021 16:04109,65462,147,05339,558,0001,014,0002,269,184
9Sep 15, 2021 16:04110,61972,577,21438,933,0001,996,0002,289,664
10Sep 15, 2021 16:04118,965105,303,98644,016,87702,248,704
11Sep 15, 2021 16:04119,315109,601,21844,146,55002,260,992
12Sep 15, 2021 16:04120,413107,723,19244,552,84302,260,992