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 14, 2025 22:36Aniruddha DebAniruddha DebScore: 117,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2025 22:36117,04169,390,56043,305,00002,531,328
2Mar 14, 2025 22:36117,39763,881,63442,427,0001,010,0002,433,024
3Mar 14, 2025 22:36117,99272,478,81242,642,0001,015,0002,428,928