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 listSep 28, 2023 16:59mmalczakmmalczakScore: 70,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 16:5970,11450,865,44124,945,000997,0002,535,424
2Sep 28, 2023 16:5970,24348,931,73124,991,000999,0002,420,736
3Sep 28, 2023 16:5970,37647,141,55524,036,0002,003,0002,535,424
4Sep 28, 2023 16:5970,38146,931,94024,038,0002,003,0002,535,424
5Sep 28, 2023 16:5970,49250,159,30325,079,0001,003,0002,535,424
6Sep 28, 2023 16:5970,52756,235,52425,092,0001,003,0002,433,024
7Sep 28, 2023 16:5970,56853,966,41625,106,0001,004,0002,428,928
8Sep 28, 2023 16:5970,73250,429,18924,158,0002,013,0002,433,024
9Sep 28, 2023 16:5970,94348,811,49825,240,0001,009,0002,535,424
10Sep 28, 2023 16:5973,64483,820,27927,248,17202,281,472
11Sep 28, 2023 16:5973,99293,183,07327,376,96602,281,472
12Sep 28, 2023 16:5974,443101,175,27727,543,77002,277,376