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 14:46Yuriy LyfenkoYuriy LyfenkoScore: 121,259Success
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 14:46120,12268,671,73343,435,0001,010,0002,514,944
2Jul 13, 2021 14:46120,31968,450,26742,495,0002,023,0002,519,040
3Jul 13, 2021 14:46120,42772,480,24843,546,0001,012,0002,510,848
4Jul 13, 2021 14:46120,64375,278,63343,624,0001,014,0002,523,136
5Jul 13, 2021 14:46121,12769,562,14542,826,0001,991,0002,334,720
6Jul 13, 2021 14:46121,21179,873,59542,855,0001,993,0002,334,720
7Jul 13, 2021 14:46121,25970,631,81942,872,0001,994,0002,334,720
8Jul 13, 2021 14:46121,37873,908,63141,916,0002,994,0002,334,720
9Jul 13, 2021 14:46121,59569,140,33141,991,0002,999,0002,514,944
10Jul 13, 2021 14:46123,645113,827,41245,748,71002,183,168
11Jul 13, 2021 14:46123,941102,716,42045,858,32402,179,072
12Jul 13, 2021 14:46125,164107,211,68046,310,53602,187,264