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 13, 2025 23:39Aniruddha DebAniruddha DebScore: 172,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2025 23:39171,86592,035,18462,581,0001,009,0002,531,328
2Mar 13, 2025 23:39172,56587,422,11662,852,000997,0002,531,328
3Mar 13, 2025 23:39172,59793,079,76561,866,0001,995,0002,531,328