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: 73,284Success
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:3972,77356,819,60724,932,0001,994,0002,363,392
2Jul 16, 2023 15:3972,83053,111,61925,949,000998,0002,281,472
3Jul 16, 2023 15:3973,00054,952,86425,010,0002,000,0002,351,104
4Jul 16, 2023 15:3973,13852,644,13826,059,0001,002,0002,363,392
5Jul 16, 2023 15:3973,17059,985,72425,068,0002,005,0002,355,200
6Jul 16, 2023 15:3973,21954,438,35425,085,0002,006,0002,355,200
7Jul 16, 2023 15:3973,28458,199,89026,111,0001,004,0002,281,472
8Jul 16, 2023 15:3973,47648,338,23525,173,0002,013,0002,289,664
9Jul 16, 2023 15:3976,37991,037,91328,260,34902,199,552
10Jul 16, 2023 15:3976,45791,838,29728,289,09902,191,360
11Jul 16, 2023 15:3977,09287,396,79428,524,01302,191,360
12Jul 16, 2023 15:3980,89551,985,08626,938,0002,993,0002,289,664