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 28, 2023 20:40Franek KortaFranek KortaScore: 100,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 20:4099,787104,044,09236,921,16002,293,760
2Aug 28, 2023 20:40100,41597,230,14037,153,48902,285,568
3Aug 28, 2023 20:40100,44597,947,21037,164,78102,170,880