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:39Paul MasurelPaul MasurelScore: 71,224Success
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:3970,71947,322,13225,160,0001,006,0002,359,296
2Jul 16, 2023 15:3970,93051,439,13125,235,0001,009,0002,355,200
3Jul 16, 2023 15:3970,94948,750,95125,242,0001,009,0002,281,472
4Jul 16, 2023 15:3970,99749,431,76524,249,0002,020,0002,289,664
5Jul 16, 2023 15:3971,10848,821,33425,299,0001,011,0002,363,392
6Jul 16, 2023 15:3971,11946,859,92925,302,0001,012,0002,363,392
7Jul 16, 2023 15:3971,22448,673,24526,353,00002,351,104
8Jul 16, 2023 15:3972,01151,842,09025,620,0001,024,0002,355,200
9Jul 16, 2023 15:3974,075107,765,64127,407,92002,191,360
10Jul 16, 2023 15:3974,52690,752,25727,574,52602,195,456
11Jul 16, 2023 15:3974,55692,108,24827,585,66202,260,992
12Jul 16, 2023 15:3985,03851,750,64631,464,00002,289,664