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:32Paul MasurelPaul MasurelScore: 70,949Success
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:3270,01956,669,95424,911,000996,0002,281,472
2Jul 16, 2023 15:3270,13056,213,96624,950,000998,0002,289,664
3Jul 16, 2023 15:3270,13256,641,86323,953,0001,996,0002,359,296
4Jul 16, 2023 15:3270,17356,055,49923,967,0001,997,0002,289,664
5Jul 16, 2023 15:3270,51154,330,97224,083,0002,006,0002,363,392
6Jul 16, 2023 15:3270,60547,630,17125,120,0001,004,0002,355,200
7Jul 16, 2023 15:3270,94948,675,22125,242,0001,009,0002,289,664
8Jul 16, 2023 15:3270,95949,820,16124,236,0002,019,0002,355,200
9Jul 16, 2023 15:3273,31592,500,65127,126,46802,203,648
10Jul 16, 2023 15:3273,908120,100,87727,346,11402,183,168
11Jul 16, 2023 15:3274,477109,111,04327,556,57002,256,896
12Jul 16, 2023 15:3282,13858,595,32930,391,00002,289,664