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:25SerVerXPlanetSerVerXPlanetScore: 683,569Success
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:25681,338315,158,238252,094,98702,289,664
2Jul 12, 2021 15:25683,569304,549,017252,920,64002,289,664
3Jul 12, 2021 15:25685,583319,685,518253,665,84002,293,760