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 24, 2024 18:26DanielDanielScore: 114,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 18:26114,25464,969,12640,261,0002,013,0002,363,392
2Jul 24, 2024 18:26114,34364,690,80141,300,0001,007,0002,363,392
3Jul 24, 2024 18:26114,36867,977,50840,301,0002,015,0002,363,392
4Jul 24, 2024 18:26114,38168,427,89840,306,0002,015,0002,289,664
5Jul 24, 2024 18:26114,52766,044,80940,358,0002,017,0002,289,664
6Jul 24, 2024 18:26114,76562,488,36141,452,0001,011,0002,289,664
7Jul 24, 2024 18:26114,892105,025,06042,509,86002,195,456
8Jul 24, 2024 18:26115,25973,828,43442,646,00002,359,296
9Jul 24, 2024 18:26115,76566,886,91041,837,000996,0002,371,584
10Jul 24, 2024 18:26115,781114,023,81142,838,90602,207,744
11Jul 24, 2024 18:26115,82274,786,77140,861,0001,993,0002,457,600
12Jul 24, 2024 18:26116,197104,641,37842,992,81002,203,648