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 listMay 22, 2024 15:13Maxim ElchuginMaxim ElchuginScore: 2,215,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 15:131,247,189512,132,763461,460,05902,248,704
2May 22, 2024 15:132,215,403884,082,366819,699,26402,260,992
3May 22, 2024 15:132,248,261903,814,042831,856,58602,392,064