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:19Aniruddha DebAniruddha DebScore: 74,068Success
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:1973,71948,159,91426,266,0001,010,0002,531,328
2Mar 17, 2025 23:1974,06849,487,11126,390,0001,015,0002,531,328
3Mar 17, 2025 23:1974,48450,601,86326,539,0001,020,0002,269,184