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 listApr 9, 2023 17:12Franek KortaFranek KortaScore: 84,060Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 17:1282,88099,149,88730,665,56002,174,976
2Apr 9, 2023 17:1284,06087,174,36131,102,06602,293,760
3Apr 9, 2023 17:1284,38297,896,76531,221,36502,301,952