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 3, 2022 18:11Franek KortaFranek KortaScore: 140,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2022 18:11140,187116,016,96551,869,15202,248,704
2Aug 3, 2022 18:11140,620129,617,16652,029,29502,248,704
3Aug 3, 2022 18:11140,836112,622,31152,109,42102,269,184