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 17:41SerVerXPlanetSerVerXPlanetScore: 663,179Success
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 17:41659,021314,808,650243,837,76802,293,760
2Jul 12, 2021 17:41663,179315,851,838245,376,36702,285,568
3Jul 12, 2021 17:41670,734316,087,487248,171,76002,293,760