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 21:24Aniruddha DebAniruddha DebScore: 70,514Success
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 21:2470,44345,327,16925,062,0001,002,0002,531,328
2Mar 17, 2025 21:2470,51446,047,03825,087,0001,003,0002,424,832
3Mar 17, 2025 21:2470,59246,109,80525,115,0001,004,0002,428,928