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 listApr 28, 2024 13:00Joad NacerJoad NacerScore: 21,556,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2024 13:0021,472,8388,006,545,8147,944,950,17502,297,856
2Apr 28, 2024 13:0021,556,6728,035,462,0937,975,968,64002,297,856
3Apr 28, 2024 13:0021,599,4848,060,710,2467,991,809,10502,301,952