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 listSep 1, 2022 00:30Yurkov AlekseyYurkov AlekseyScore: 164,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2022 00:3099,648116,350,33536,869,76802,273,280
2Sep 1, 2022 00:3099,889122,561,25036,959,05902,265,088
3Sep 1, 2022 00:30100,810103,016,06937,299,74702,265,088
4Sep 1, 2022 00:30164,84984,724,34259,995,000999,0002,289,664
5Sep 1, 2022 00:30164,85481,877,78558,997,0001,999,0002,375,680
6Sep 1, 2022 00:30164,91982,788,75559,020,0002,000,0002,273,280
7Sep 1, 2022 00:30164,98484,027,83359,043,0002,001,0002,289,664
8Sep 1, 2022 00:30165,07086,734,39759,074,0002,002,0002,273,280
9Sep 1, 2022 00:30165,10389,485,56760,087,0001,001,0002,531,328
10Sep 1, 2022 00:30165,37883,919,16259,184,0002,006,0002,367,488
11Sep 1, 2022 00:30165,64182,765,13460,283,0001,004,0002,523,136
12Sep 1, 2022 00:30165,85984,422,83760,362,0001,006,0002,289,664