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 listNov 29, 2024 19:29E SequeiraE SequeiraScore: 175,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 19:29175,22289,400,74762,838,0001,994,0002,285,568
2Nov 29, 2024 19:29175,58196,573,25062,967,0001,998,0002,285,568
3Nov 29, 2024 19:29176,20390,878,32563,189,0002,006,0002,269,184