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 15:13Aniruddha DebAniruddha DebScore: 67,132Success
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 15:1366,68150,205,93724,672,00002,531,328
2Aug 16, 2025 15:1366,75154,145,56923,669,0001,029,0002,433,024
3Aug 16, 2025 15:1367,11949,910,63423,841,000993,0002,424,832
4Aug 16, 2025 15:1367,13249,518,18323,846,000993,0002,428,928
5Aug 16, 2025 15:1367,13548,100,98922,853,0001,987,0002,428,928
6Aug 16, 2025 15:1367,14652,364,80824,844,00002,531,328