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 14, 2021 10:04Andrey TsvetkovAndrey TsvetkovScore: 86,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 10:0484,65452,358,71829,302,0002,020,0002,510,848
2Jul 14, 2021 10:0485,08957,675,19830,468,0001,015,0002,498,560
3Jul 14, 2021 10:0485,15953,311,85330,493,0001,016,0002,334,720
4Jul 14, 2021 10:0485,29257,316,25430,540,0001,018,0002,502,656
5Jul 14, 2021 10:0485,30853,369,21130,546,0001,018,0002,322,432
6Jul 14, 2021 10:0485,34654,701,84930,560,0001,018,0002,334,720
7Jul 14, 2021 10:0486,11958,782,92529,873,0001,991,0002,334,720
8Jul 14, 2021 10:0486,13257,638,70829,878,0001,991,0002,510,848
9Jul 14, 2021 10:0486,14662,015,09428,886,0002,988,0002,510,848
10Jul 14, 2021 10:0488,086105,630,09132,591,88602,187,264
11Jul 14, 2021 10:0488,79496,249,79332,853,84102,174,976
12Jul 14, 2021 10:0489,325104,482,78533,050,24202,187,264