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:54Bernard TeoBernard TeoScore: 3,131Success
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:553,127533,024,454468,986,924016,904,192
2Apr 17, 2023 16:543,128537,387,340469,148,734016,908,288
3Apr 17, 2023 16:553,128532,735,273469,126,104016,908,288
4Apr 17, 2023 16:543,129533,570,868469,403,739016,896,000
5Apr 17, 2023 16:563,129535,056,271469,318,074016,904,192
6Apr 17, 2023 16:543,130541,569,664469,433,183016,904,192
7Apr 17, 2023 16:543,131532,341,716469,592,282016,904,192
8Apr 17, 2023 16:543,131524,848,572469,721,315016,904,192
9Apr 17, 2023 16:553,132528,696,481469,748,966016,908,288
10Apr 17, 2023 16:563,132537,906,244469,864,180016,908,288
11Apr 17, 2023 16:543,133541,178,567469,931,842016,900,096
12Apr 17, 2023 16:563,133539,274,224470,021,905016,904,192