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 listDec 24, 2023 16:07Kenneth MaplesKenneth MaplesScore: 4,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 16:074,648752,068,387697,191,893016,949,248
2Dec 24, 2023 16:074,649759,510,783697,424,054016,941,056
3Dec 24, 2023 16:074,672788,390,912700,742,571016,941,056
4Dec 24, 2023 16:074,738739,614,206682,674,00027,986,00017,076,224
5Dec 24, 2023 16:074,743733,381,759680,500,00030,977,00016,965,632
6Dec 24, 2023 16:074,747734,349,196682,032,00030,001,00016,957,440
7Dec 24, 2023 16:074,747744,670,157685,103,00027,004,00016,965,632
8Dec 24, 2023 16:074,751735,587,045683,688,00028,986,00016,969,728
9Dec 24, 2023 16:074,756739,708,580688,371,00024,977,00017,055,744
10Dec 24, 2023 16:074,759741,887,036688,853,00024,994,00017,072,128
11Dec 24, 2023 16:074,759737,855,406684,882,00028,995,00017,092,608
12Dec 24, 2023 16:074,767746,396,961685,096,00030,004,00016,998,400