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:28Franek KortaFranek KortaScore: 139,813Success
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:28139,663114,869,59051,675,26902,293,760
2Aug 3, 2022 18:28139,813120,632,38151,730,70402,256,896
3Aug 3, 2022 18:28140,028110,664,04351,810,30702,256,896