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:28Aniruddha DebAniruddha DebScore: 75,314Success
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:2875,27858,401,01026,859,000994,0002,531,328
2Mar 17, 2025 23:2875,31457,919,36226,871,000995,0002,420,736
3Mar 17, 2025 23:2879,55754,228,41528,421,0001,015,0002,428,928