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,327Success
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:2874,81151,956,14327,680,00002,437,120
2Mar 17, 2025 23:2875,32753,682,64327,871,00002,510,848
3Mar 17, 2025 23:2875,78450,834,30327,039,0001,001,0002,531,328