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 listFeb 22, 2024 03:22Huy Duc LeHuy Duc LeScore: 75,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 03:2275,25956,007,23426,852,000994,0002,281,472
2Feb 22, 2024 03:2275,26555,533,86826,854,000994,0002,490,368
3Feb 22, 2024 03:2275,45452,738,72325,924,0001,994,0002,281,472
4Feb 22, 2024 03:2275,58656,200,24325,970,0001,997,0002,285,568
5Feb 22, 2024 03:2275,66553,351,65124,997,0002,999,0002,281,472
6Feb 22, 2024 03:2275,83248,693,27826,054,0002,004,0002,338,816
7Feb 22, 2024 03:2275,96857,142,70426,101,0002,007,0002,281,472
8Feb 22, 2024 03:2276,00053,656,87423,099,0005,021,0002,494,464
9Feb 22, 2024 03:2276,00049,115,51624,103,0004,017,0002,281,472
10Feb 22, 2024 03:2279,417111,517,42229,384,27802,232,320
11Feb 22, 2024 03:2279,662104,029,68029,475,11402,232,320
12Feb 22, 2024 03:2279,967129,125,46429,587,68902,203,648