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 16, 2023 15:07Paul MasurelPaul MasurelScore: 70,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 15:0769,84148,669,50124,848,000993,0002,363,392
2Jul 16, 2023 15:0769,85751,710,55124,853,000994,0002,289,664
3Jul 16, 2023 15:0769,85956,932,37623,860,0001,988,0002,359,296
4Jul 16, 2023 15:0769,87351,484,56623,865,0001,988,0002,289,664
5Jul 16, 2023 15:0769,87650,587,08224,860,000994,0002,359,296
6Jul 16, 2023 15:0769,89755,853,24624,868,000994,0002,289,664
7Jul 16, 2023 15:0770,10853,166,81823,945,0001,995,0002,289,664
8Jul 16, 2023 15:0770,12456,678,27924,949,000997,0002,281,472
9Jul 16, 2023 15:0771,64349,004,06525,489,0001,019,0002,289,664
10Jul 16, 2023 15:0772,76693,610,70526,923,48402,314,240
11Jul 16, 2023 15:0773,72696,316,10427,278,62402,195,456
12Jul 16, 2023 15:0775,57297,926,45427,961,77202,187,264