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 27, 2022 17:07apuxbtapuxbtScore: 22,134,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 17:0722,132,7268,255,179,1238,189,108,74502,285,568
2Nov 27, 2022 17:0722,134,9708,247,006,2298,189,938,77502,289,664
3Nov 27, 2022 17:0722,151,2658,263,739,2428,195,968,10802,293,760