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 26, 2023 11:16Yurkov AlekseyYurkov AlekseyScore: 141,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 11:16140,988113,731,05052,165,72902,265,088
2Mar 26, 2023 11:16141,007119,176,74052,172,61002,265,088
3Mar 26, 2023 11:16141,617133,571,82452,398,34302,269,184