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 10:51Andrey TsvetkovAndrey TsvetkovScore: 96,405Success
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 10:5195,47860,602,90733,309,0002,018,0002,531,328
2Jul 13, 2021 10:5195,73556,589,07132,386,0003,036,0002,527,232
3Jul 13, 2021 10:5195,74954,242,08133,403,0002,024,0002,531,328
4Jul 13, 2021 10:5195,94163,554,17833,470,0002,028,0002,334,720
5Jul 13, 2021 10:5196,07857,176,69634,534,0001,015,0002,527,232
6Jul 13, 2021 10:5196,34164,792,98733,610,0002,036,0002,351,104
7Jul 13, 2021 10:5196,40562,881,17434,651,0001,019,0002,334,720
8Jul 13, 2021 10:5196,41665,956,60234,655,0001,019,0002,514,944
9Jul 13, 2021 10:5196,89262,533,72733,859,0001,991,0002,531,328
10Jul 13, 2021 10:5199,170117,425,66236,692,82202,199,552
11Jul 13, 2021 10:5199,19496,608,36736,701,60002,207,744
12Jul 13, 2021 10:5199,944106,137,66336,979,09802,195,456