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 6, 2022 19:10Franek KortaFranek KortaScore: 84,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 19:1084,19099,305,84431,150,32002,269,184
2Aug 6, 2022 19:1084,712101,879,93231,343,44402,265,088
3Aug 6, 2022 19:1084,890103,408,23631,409,45902,256,896