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 listMay 23, 2024 04:37CemaCemaScore: 96,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 04:3795,82461,438,67133,429,0002,026,0002,494,464
2May 23, 2024 04:3795,86862,510,70434,458,0001,013,0002,506,752
3May 23, 2024 04:3795,90059,781,32233,456,0002,027,0002,285,568
4May 23, 2024 04:3796,14357,753,84634,557,0001,016,0002,293,760
5May 23, 2024 04:3796,21662,337,72334,583,0001,017,0002,285,568
6May 23, 2024 04:3796,33065,760,37932,587,0003,055,0002,498,560
7May 23, 2024 04:3796,81162,930,19533,830,0001,990,0002,285,568
8May 23, 2024 04:3796,85162,707,31534,840,000995,0002,490,368
9May 23, 2024 04:3796,89563,776,86831,868,0003,983,0002,285,568
10May 23, 2024 04:37101,782123,848,61037,659,22102,199,552
11May 23, 2024 04:37102,569105,061,56337,950,37602,457,600
12May 23, 2024 04:37102,713112,752,31938,003,74802,207,744