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 23, 2024 16:57E SequeiraE SequeiraScore: 160,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 16:57160,12784,729,37657,239,0002,008,0002,289,664
2Nov 23, 2024 16:57160,22782,332,14758,280,0001,004,0002,289,664
3Nov 23, 2024 16:57160,66282,219,72858,438,0001,007,0002,367,488
4Nov 23, 2024 16:57160,80084,441,43558,488,0001,008,0002,265,088
5Nov 23, 2024 16:57160,80885,460,70858,491,0001,008,0002,265,088
6Nov 23, 2024 16:57160,81684,185,27958,494,0001,008,0002,269,184
7Nov 23, 2024 16:57160,84181,769,92259,511,00002,523,136
8Nov 23, 2024 16:57160,85788,743,66457,500,0002,017,0002,265,088
9Nov 23, 2024 16:57161,24383,044,00259,660,00002,285,568