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:31Paul MasurelPaul MasurelScore: 70,903Success
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:3169,96256,075,82224,891,000995,0002,355,200
2Jul 16, 2023 15:3170,00356,635,26325,901,00002,342,912
3Jul 16, 2023 15:3170,01150,248,33024,908,000996,0002,363,392
4Jul 16, 2023 15:3170,13554,643,00724,952,000998,0002,289,664
5Jul 16, 2023 15:3170,40352,154,35124,046,0002,003,0002,359,296
6Jul 16, 2023 15:3170,61450,146,60025,123,0001,004,0002,355,200
7Jul 16, 2023 15:3170,90354,815,92725,225,0001,009,0002,351,104
8Jul 16, 2023 15:3172,55155,559,34524,856,0001,988,0002,351,104
9Jul 16, 2023 15:3174,02299,326,19727,388,16902,195,456
10Jul 16, 2023 15:3178,34355,496,02226,988,0001,999,0002,289,664
11Jul 16, 2023 15:3182,510103,262,89730,528,66502,191,360
12Jul 16, 2023 15:3184,947118,494,43231,430,49602,256,896