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:16E SequeiraE SequeiraScore: 105,000Success
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:16103,57856,161,76536,307,0002,017,0002,273,280
2Nov 29, 2024 19:16103,60564,149,02137,326,0001,008,0002,285,568
3Nov 29, 2024 19:16104,96270,409,42237,841,000995,0002,265,088
4Nov 29, 2024 19:16104,98466,458,71437,848,000996,0002,285,568
5Nov 29, 2024 19:16105,00063,542,29636,858,0001,992,0002,269,184
6Nov 29, 2024 19:16105,06569,934,47336,881,0001,993,0002,273,280
7Nov 29, 2024 19:16105,30363,491,73237,963,000999,0002,269,184
8Nov 29, 2024 19:16105,55166,569,83537,102,0001,952,0002,441,216
9Nov 29, 2024 19:16107,65167,874,19537,840,0001,991,0002,285,568