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 listAug 16, 2025 14:52Aniruddha DebAniruddha DebScore: 69,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 14:5268,88642,559,56425,488,00002,416,640
2Aug 16, 2025 14:5269,29741,002,58925,640,00002,412,544
3Aug 16, 2025 14:5269,42448,172,71425,687,00002,519,040