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 18:02Yuriy LyfenkoYuriy LyfenkoScore: 96,468Success
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 18:0295,01959,975,76332,144,0003,013,0002,490,368
2Jul 13, 2021 18:0295,10357,940,43933,178,0002,010,0002,314,240
3Jul 13, 2021 18:0295,57859,058,32933,344,0002,020,0002,498,560
4Jul 13, 2021 18:0296,12460,620,13633,534,0002,032,0002,310,144
5Jul 13, 2021 18:0296,33064,624,91634,624,0001,018,0002,486,272
6Jul 13, 2021 18:0296,34963,762,72634,631,0001,018,0002,490,368
7Jul 13, 2021 18:0296,46863,476,72634,674,0001,019,0002,351,104
8Jul 13, 2021 18:0296,67592,101,71935,769,63102,297,856
9Jul 13, 2021 18:0297,02092,056,94735,897,41802,293,760
10Jul 13, 2021 18:0297,34165,909,86433,015,0003,001,0002,310,144
11Jul 13, 2021 18:0297,77366,456,90233,162,0003,014,0002,498,560
12Jul 13, 2021 18:0298,22096,682,56436,341,44402,289,664