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 listApr 3, 2023 22:08Franek KortaFranek KortaScore: 73,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 22:0873,14355,306,55326,061,0001,002,0002,445,312
2Apr 3, 2023 22:0873,38648,713,10325,142,0002,011,0002,445,312
3Apr 3, 2023 22:0873,39550,057,56826,151,0001,005,0002,445,312
4Apr 3, 2023 22:0873,41652,035,67824,146,0003,018,0002,269,184
5Apr 3, 2023 22:0873,76555,245,24924,261,0003,032,0002,441,216
6Apr 3, 2023 22:0873,78153,708,87427,299,00002,269,184
7Apr 3, 2023 22:0873,85954,465,25427,328,00002,531,328
8Apr 3, 2023 22:0873,87849,190,98826,323,0001,012,0002,531,328
9Apr 3, 2023 22:0873,95149,142,43226,349,0001,013,0002,269,184
10Apr 3, 2023 22:0875,212101,444,12527,828,52102,293,760
11Apr 3, 2023 22:0875,38488,019,17027,892,00302,289,664
12Apr 3, 2023 22:0875,777114,842,94128,037,61302,285,568