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 13, 2021 09:42SerVerXPlanetSerVerXPlanetScore: 237,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 09:42236,628146,142,20887,552,18202,252,800
2Jul 13, 2021 09:42237,703146,343,90887,950,11602,256,896
3Jul 13, 2021 09:42238,607146,303,02288,284,74302,248,704