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 17, 2025 21:21Aniruddha DebAniruddha DebScore: 69,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2025 21:2169,87848,963,63524,861,000994,0002,428,928
2Mar 17, 2025 21:2169,88648,540,71724,864,000994,0002,433,024
3Mar 17, 2025 21:2170,22447,536,27623,985,0001,998,0002,531,328