Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listApr 17, 2023 16:47Bernard TeoBernard TeoScore: 5,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2023 16:475,133842,411,755769,982,725016,973,824
2Apr 17, 2023 16:505,133834,229,438769,990,936016,982,016
3Apr 17, 2023 16:505,136842,579,169770,407,773016,969,728
4Apr 17, 2023 16:475,137854,903,594770,479,519016,965,632
5Apr 17, 2023 16:475,139828,336,816770,922,826016,965,632
6Apr 17, 2023 16:505,140842,588,492770,933,581016,961,536