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 14, 2021 12:38gchebanovgchebanovScore: 83,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 12:3882,24188,838,71130,429,25802,244,608
2Jul 14, 2021 12:3883,25089,780,21530,802,34002,244,608
3Jul 14, 2021 12:3883,95889,215,31731,064,50002,248,704