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 6, 2022 15:00Eugene ZhydzetskiEugene ZhydzetskiScore: 112,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2022 15:00110,95467,499,23839,051,0002,002,0002,519,040
2Sep 6, 2022 15:00111,02767,925,08740,079,0001,001,0002,523,136
3Sep 6, 2022 15:00111,04170,018,15740,083,0001,002,0002,510,848
4Sep 6, 2022 15:00111,06566,281,07039,090,0002,004,0002,523,136
5Sep 6, 2022 15:00111,48668,150,17439,238,0002,012,0002,334,720
6Sep 6, 2022 15:00111,51162,861,86540,253,0001,006,0002,334,720
7Sep 6, 2022 15:00112,33070,637,59441,562,00002,334,720
8Sep 6, 2022 15:00112,39267,273,48340,571,0001,014,0002,510,848
9Sep 6, 2022 15:00112,47669,848,36340,601,0001,015,0002,334,720
10Sep 6, 2022 15:00113,749115,556,69942,087,14802,183,168
11Sep 6, 2022 15:00114,242100,609,43842,269,68602,191,360
12Sep 6, 2022 15:00115,141109,241,00542,602,34002,314,240