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 listMay 26, 2025 07:10E SequeiraE SequeiraScore: 89,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 07:1088,36256,924,28631,673,0001,021,0002,277,376
2May 26, 2025 07:1089,65757,339,94431,163,0002,010,0002,396,160
3May 26, 2025 07:1090,24359,034,25431,367,0002,023,0002,285,568