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 14, 2025 22:43Aniruddha DebAniruddha DebScore: 116,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2025 22:43115,16568,768,10342,611,00002,269,184
2Mar 14, 2025 22:43115,77664,888,47740,845,0001,992,0002,531,328
3Mar 14, 2025 22:43115,80368,940,91542,847,00002,531,328
4Mar 14, 2025 22:43115,83869,206,64441,864,000996,0002,531,328
5Mar 14, 2025 22:43116,31167,722,37842,035,0001,000,0002,428,928
6Mar 14, 2025 22:43116,38164,740,50341,059,0002,002,0002,531,328
7Mar 14, 2025 22:43116,99763,435,56641,276,0002,013,0002,531,328
8Mar 14, 2025 22:43117,58667,094,50543,507,00002,437,120
9Mar 14, 2025 22:43120,17864,321,90844,466,00002,428,928