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 13, 2021 13:38Yuriy LyfenkoYuriy LyfenkoScore: 131,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 13:38131,16573,136,31647,520,0001,011,0002,334,720
2Jul 13, 2021 13:38131,17676,016,42547,524,0001,011,0002,523,136
3Jul 13, 2021 13:38131,18974,423,30647,529,0001,011,0002,514,944
4Jul 13, 2021 13:38131,23076,748,42347,544,0001,011,0002,330,624
5Jul 13, 2021 13:38131,23570,775,65047,546,0001,011,0002,334,720
6Jul 13, 2021 13:38131,33573,286,56346,570,0002,024,0002,519,040
7Jul 13, 2021 13:38131,34375,293,81746,573,0002,024,0002,383,872
8Jul 13, 2021 13:38131,35772,977,06746,577,0002,025,0002,527,232
9Jul 13, 2021 13:38131,43577,857,18447,618,0001,013,0002,527,232
10Jul 13, 2021 13:38133,473113,360,91349,384,86502,174,976
11Jul 13, 2021 13:38133,647103,407,27549,449,36102,187,264
12Jul 13, 2021 13:38133,763116,203,19749,492,34202,174,976