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 2, 2022 18:35Franek KortaFranek KortaScore: 177,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 18:35176,485119,304,96865,299,43502,252,800
2Aug 2, 2022 18:35177,201135,327,31565,564,31202,256,896
3Aug 2, 2022 18:35177,713129,923,54365,753,63202,265,088