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:57Ulyanov AlekseyUlyanov AlekseyScore: 645,174Success
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:57643,620303,359,054238,139,31602,265,088
2Jun 16, 2023 19:57645,174320,044,177238,714,31702,256,896
3Jun 16, 2023 19:57648,139308,047,318239,811,24702,269,184