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:10E SequeiraE SequeiraScore: 216,365Success
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:10213,781105,939,97478,098,0001,001,0002,269,184
2Nov 29, 2024 19:10216,365106,107,85878,054,0002,001,0002,285,568
3Nov 29, 2024 19:10216,503110,101,61579,105,0001,001,0002,273,280