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 listNov 29, 2024 20:56E SequeiraE SequeiraScore: 180,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 20:56180,67696,319,71365,853,000997,0002,285,568
2Nov 29, 2024 20:56180,86595,123,75964,923,0001,997,0002,273,280
3Nov 29, 2024 20:56180,95192,956,48265,953,000999,0002,285,568