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 8, 2024 06:11E SequeiraE SequeiraScore: 6,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2024 06:096,7121,031,862,436981,839,00024,995,00017,170,432
2Dec 8, 2024 06:096,8371,058,778,8411,001,620,00023,990,00017,125,376
3Dec 8, 2024 06:116,8461,055,632,0321,001,915,00024,997,00016,965,632
4Dec 8, 2024 06:096,8661,059,555,9201,005,922,00023,998,00016,998,400
5Dec 8, 2024 06:096,8821,063,700,0931,006,381,00025,984,00017,100,800
6Dec 8, 2024 06:096,8971,064,427,2901,009,604,00024,990,00017,022,976
7Dec 8, 2024 06:096,9001,066,863,5191,015,045,00020,000,00016,969,728
8Dec 8, 2024 06:096,9071,066,967,5631,009,140,00026,977,00017,162,240
9Dec 8, 2024 06:116,9101,064,033,9461,013,551,00022,989,00017,149,952
10Dec 8, 2024 06:096,9181,061,068,1341,013,749,00023,994,00017,178,624
11Dec 8, 2024 06:116,9201,067,689,5341,014,036,00024,000,00017,072,128
12Dec 8, 2024 06:096,9741,076,404,1701,019,031,00027,000,00016,965,632