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 08:26SerVerXPlanetSerVerXPlanetScore: 501,341Success
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 08:26498,483245,469,180184,438,57602,293,760
2Jul 13, 2021 08:26501,341254,647,606185,496,08002,289,664
3Jul 13, 2021 08:26502,474235,374,058185,915,27502,293,760