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:12E SequeiraE SequeiraScore: 170,719Success
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:12170,70888,236,76761,157,0002,005,0002,265,088
2Nov 29, 2024 19:12170,71987,427,08861,161,0002,005,0002,285,568
3Nov 29, 2024 19:12170,76889,654,29561,179,0002,005,0002,285,568