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 22, 2024 20:00CemaCemaScore: 109,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 20:00108,61661,731,09537,174,0003,014,0002,281,472
2May 22, 2024 20:00108,69264,664,25338,206,0002,010,0002,502,656
3May 22, 2024 20:00108,75766,756,41137,222,0003,018,0002,281,472
4May 22, 2024 20:00108,88664,652,67538,274,0002,014,0002,506,752
5May 22, 2024 20:00109,32263,653,35339,438,0001,011,0002,281,472
6May 22, 2024 20:00109,76268,336,89139,597,0001,015,0002,281,472
7May 22, 2024 20:00109,95966,073,06739,668,0001,017,0002,494,464
8May 22, 2024 20:00110,38673,465,09737,855,0002,988,0002,281,472
9May 22, 2024 20:00110,48165,166,82637,887,0002,991,0002,281,472
10May 22, 2024 20:00114,586119,412,81242,396,86902,236,416
11May 22, 2024 20:00114,937107,562,31142,526,57302,240,512
12May 22, 2024 20:00115,385108,748,15142,692,52002,244,608