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 23, 2024 17:13StanStanScore: 725,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 17:13724,797339,695,938268,174,83102,207,744
2May 23, 2024 17:13725,701327,225,721268,509,34102,203,648
3May 23, 2024 17:13726,268339,819,174268,719,23102,207,744