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 28, 2024 18:17Joad NacerJoad NacerScore: 59,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 18:1759,71142,499,01021,089,0001,004,0002,510,848
2Nov 28, 2024 18:1759,72744,738,09120,090,0002,009,0002,437,120
3Nov 28, 2024 18:1759,74647,129,93020,097,0002,009,0002,437,120