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 13, 2024 14:27Dan StolyarovDan StolyarovScore: 301,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 14:27299,173137,574,74962,826,00047,868,0002,285,568
2Nov 13, 2024 14:27299,330138,162,77062,859,00047,893,0002,400,256
3Nov 13, 2024 14:27299,441135,629,46863,881,00046,912,0002,465,792
4Nov 13, 2024 14:27300,941139,147,31760,188,00051,160,0002,465,792
5Nov 13, 2024 14:27301,286138,051,68760,257,00051,219,0002,285,568
6Nov 13, 2024 14:27301,530135,699,86764,748,00046,818,0002,297,856
7Nov 13, 2024 14:27302,968134,271,63366,058,00046,040,0002,461,696
8Nov 13, 2024 14:27303,762139,674,83764,224,00048,168,0002,469,888
9Nov 13, 2024 14:27303,786136,535,46060,215,00052,186,0002,281,472