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 listOct 27, 2024 11:05Xushi8Xushi8Score: 1,622,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2024 11:051,304,335511,244,971292,760,000189,844,0002,449,408
2Oct 27, 2024 11:051,498,743580,976,409351,705,000202,830,0002,404,352
3Oct 27, 2024 11:051,549,011600,429,232377,430,000195,704,0002,433,024
4Oct 27, 2024 11:051,611,116629,037,480411,388,000184,725,0002,277,376
5Oct 27, 2024 11:051,622,043627,126,619397,441,000202,715,0002,338,816
6Oct 27, 2024 11:051,958,989759,065,510530,142,000194,684,0002,306,048
7Oct 27, 2024 11:052,168,570827,819,083612,520,000189,851,0002,334,720
8Oct 27, 2024 11:052,178,368837,109,540606,245,000199,751,0002,392,064
9Oct 27, 2024 11:052,236,497854,501,694629,623,000197,881,0002,478,080