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 listJun 16, 2023 19:54Ulyanov AlekseyUlyanov AlekseyScore: 1,270,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2023 19:541,268,900529,662,826469,493,08102,265,088
2Jun 16, 2023 19:541,270,230532,983,085469,985,11302,252,800
3Jun 16, 2023 19:541,272,926547,434,223470,982,73702,269,184