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 listMay 23, 2024 16:55StanStanScore: 459,067Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 16:55459,038224,796,574169,844,00302,252,800
2May 23, 2024 16:55459,067233,541,550169,854,77002,240,512
3May 23, 2024 16:55459,083226,331,944169,860,74002,252,800