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:33Andrey TsvetkovAndrey TsvetkovScore: 105,441Success
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:33104,88666,280,62535,823,0002,985,0002,527,232
2Jul 13, 2021 10:33104,97864,722,86536,851,0001,991,0002,514,944
3Jul 13, 2021 10:33105,01663,251,29737,860,000996,0002,334,720
4Jul 13, 2021 10:33105,01961,143,01036,865,0001,992,0002,523,136
5Jul 13, 2021 10:33105,03568,092,74435,874,0002,989,0002,519,040
6Jul 13, 2021 10:33105,12464,639,61136,902,0001,994,0002,387,968
7Jul 13, 2021 10:33105,44166,657,76937,013,0002,000,0002,387,968
8Jul 13, 2021 10:33105,55967,880,80337,055,0002,002,0002,334,720
9Jul 13, 2021 10:33106,09262,433,83637,241,0002,013,0002,334,720
10Jul 13, 2021 10:33108,167105,001,37940,021,88302,207,744
11Jul 13, 2021 10:33108,191102,233,04740,030,49502,207,744
12Jul 13, 2021 10:33108,82195,587,56340,263,70202,199,552