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 06:57E SequeiraE SequeiraScore: 150,219Success
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 06:57149,92477,409,08955,472,00002,482,176
2May 26, 2025 06:57150,21978,294,75653,560,0002,021,0002,486,272
3May 26, 2025 06:57150,40383,352,62853,626,0002,023,0002,326,528