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 12, 2021 14:04SerVerXPlanetSerVerXPlanetScore: 21,345,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2021 14:0421,263,3187,934,389,8837,867,427,76902,281,472
2Jul 12, 2021 14:0421,345,4157,958,660,5707,897,803,42402,293,760
3Jul 12, 2021 14:0421,469,3857,999,307,2297,943,672,40302,277,376