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 listNov 27, 2022 23:22apuxbtapuxbtScore: 2,074,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 23:222,064,023830,959,318763,688,55702,285,568
2Nov 27, 2022 23:222,074,364837,331,482767,514,70302,285,568
3Nov 27, 2022 23:222,081,351841,883,468770,099,99502,277,376