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 21:09E SequeiraE SequeiraScore: 126,214Success
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 21:09126,14672,976,60545,660,0001,014,0002,277,376
2Nov 29, 2024 21:09126,21478,019,95445,684,0001,015,0002,285,568
3Nov 29, 2024 21:09126,94971,839,99044,973,0001,998,0002,285,568