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:54Andrey TsvetkovAndrey TsvetkovScore: 112,524Success
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:54111,83866,934,37539,362,0002,018,0002,334,720
2Jul 13, 2021 10:54111,86862,195,99138,363,0003,028,0002,334,720
3Jul 13, 2021 10:54112,23862,408,94839,503,0002,025,0002,334,720
4Jul 13, 2021 10:54112,30365,912,17739,526,0002,026,0002,334,720
5Jul 13, 2021 10:54112,36863,649,42540,562,0001,014,0002,523,136
6Jul 13, 2021 10:54112,39568,190,29140,572,0001,014,0002,531,328
7Jul 13, 2021 10:54112,52465,349,01639,652,0001,982,0002,527,232
8Jul 13, 2021 10:54112,54169,156,25839,609,0002,031,0002,523,136
9Jul 13, 2021 10:54112,67372,424,10440,673,0001,016,0002,523,136
10Jul 13, 2021 10:54114,889100,410,08842,508,78302,203,648
11Jul 13, 2021 10:54115,272113,711,44642,650,81802,199,552
12Jul 13, 2021 10:54115,566129,078,25842,759,26802,211,840