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 15:12SerVerXPlanetSerVerXPlanetScore: 21,306,721Success
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 15:1221,298,4137,933,247,0777,880,412,64002,289,664
2Jul 12, 2021 15:1221,306,7217,951,149,4167,883,486,80702,277,376
3Jul 12, 2021 15:1221,367,4547,964,692,7097,905,957,85402,297,856