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 listAug 21, 2021 10:09Andrey TsvetkovAndrey TsvetkovScore: 91,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2021 10:0990,42593,646,25133,457,41302,252,800
2Aug 21, 2021 10:0991,350101,615,61333,799,50202,244,608
3Aug 21, 2021 10:0991,78989,709,45533,962,03202,244,608