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 11:15Andrey TsvetkovAndrey TsvetkovScore: 95,511Success
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 11:1594,77866,320,93532,063,0003,005,0002,523,136
2Jul 13, 2021 11:1594,79560,031,04833,070,0002,004,0002,334,720
3Jul 13, 2021 11:1595,12754,103,49032,181,0003,016,0002,523,136
4Jul 13, 2021 11:1595,17065,740,73532,195,0003,018,0002,527,232
5Jul 13, 2021 11:1595,45460,619,66633,300,0002,018,0002,527,232
6Jul 13, 2021 11:1595,50564,244,46832,309,0003,028,0002,514,944
7Jul 13, 2021 11:1595,51158,023,26833,320,0002,019,0002,334,720
8Jul 13, 2021 11:1595,81158,274,19132,412,0003,038,0002,527,232
9Jul 13, 2021 11:1596,18165,787,21434,571,0001,016,0002,387,968
10Jul 13, 2021 11:1598,03896,156,52636,274,00702,207,744
11Jul 13, 2021 11:1598,328108,236,58936,381,21502,203,648
12Jul 13, 2021 11:1598,452104,432,43636,427,34602,199,552