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:11Andrey TsvetkovAndrey TsvetkovScore: 95,268Success
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:1194,47658,098,22031,960,0002,996,0002,334,720
2Jul 13, 2021 11:1194,53564,224,68331,980,0002,998,0002,523,136
3Jul 13, 2021 11:1194,58464,752,66831,997,0002,999,0002,531,328
4Jul 13, 2021 11:1194,74159,438,85732,050,0003,004,0002,527,232
5Jul 13, 2021 11:1194,78460,360,58032,064,0003,006,0002,334,720
6Jul 13, 2021 11:1194,98162,170,76332,131,0003,012,0002,514,944
7Jul 13, 2021 11:1195,26858,947,03135,249,00002,523,136
8Jul 13, 2021 11:1195,41957,522,57832,279,0003,026,0002,523,136
9Jul 13, 2021 11:1195,45760,010,59233,301,0002,018,0002,334,720
10Jul 13, 2021 11:1198,09999,782,04036,296,70002,203,648
11Jul 13, 2021 11:1198,40188,867,88136,408,49202,199,552
12Jul 13, 2021 11:1198,54998,985,05736,463,14502,195,456