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:52Bernard TeoBernard TeoScore: 3,688Success
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:523,683616,227,535552,474,094016,965,632
2Apr 17, 2023 16:523,686612,146,542552,913,432016,982,016
3Apr 17, 2023 16:523,687622,142,516553,026,215016,973,824
4Apr 17, 2023 16:523,688632,091,141553,180,825016,977,920
5Apr 17, 2023 16:523,691628,412,840553,703,140016,969,728
6Apr 17, 2023 16:523,725629,823,812558,694,899016,973,824