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:00E SequeiraE SequeiraScore: 151,846Success
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:00151,67386,368,37756,119,00002,490,368
2May 26, 2025 07:00151,84680,792,99354,177,0002,006,0002,482,176
3May 26, 2025 07:00151,85483,006,57755,183,0001,003,0002,486,272