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 15, 2021 22:54Yurkov AlekseyYurkov AlekseyScore: 122,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 22:54122,540110,421,21445,339,75802,277,376
2Jul 15, 2021 22:54122,586110,459,39045,356,67002,260,992
3Jul 15, 2021 22:54122,912112,986,79245,477,50702,260,992