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 listMar 26, 2025 17:44Aniruddha DebAniruddha DebScore: 69,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2025 17:4469,85154,196,56425,845,00002,408,448
2Mar 26, 2025 17:4469,90547,756,46723,876,0001,989,0002,412,544
3Mar 26, 2025 17:4469,97652,799,21524,896,000995,0002,408,448