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 23:30Aniruddha DebAniruddha DebScore: 75,300Success
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 23:3075,28457,567,92726,861,000994,0002,269,184
2Mar 17, 2025 23:3075,30046,575,35626,830,0001,031,0002,531,328
3Mar 17, 2025 23:3075,51650,012,19425,946,0001,995,0002,428,928