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 listJul 8, 2021 15:30Sergey StreminSergey StreminScore: 104,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 15:30103,30064,533,46837,216,0001,005,0002,289,664
2Jul 8, 2021 15:30103,55964,202,08836,301,0002,016,0002,363,392
3Jul 8, 2021 15:30103,61160,705,74238,336,00002,375,680
4Jul 8, 2021 15:30103,67859,405,07137,352,0001,009,0002,289,664
5Jul 8, 2021 15:30103,88661,104,70438,438,00002,371,584
6Jul 8, 2021 15:30104,32268,154,04837,584,0001,015,0002,289,664
7Jul 8, 2021 15:30104,547101,789,91638,682,34202,195,456
8Jul 8, 2021 15:30104,60063,979,84038,702,00002,371,584
9Jul 8, 2021 15:30104,772111,046,17538,765,56402,260,992
10Jul 8, 2021 15:30104,96869,824,76437,843,000995,0002,289,664
11Jul 8, 2021 15:30104,98669,154,16736,853,0001,992,0002,367,488
12Jul 8, 2021 15:30107,097113,044,61039,625,77902,220,032