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 02:25Dan StolyarovDan StolyarovScore: 300,014Success
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 02:25299,073137,717,29163,802,00046,855,0002,285,568
2Nov 23, 2024 02:25300,014141,407,35163,003,00048,002,0002,465,792
3Nov 23, 2024 02:25303,351135,132,61562,133,00050,107,0002,453,504