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 listMar 7, 2024 03:54Huy Duc LeHuy Duc LeScore: 3,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 03:542,941506,797,399441,184,723016,953,344
2Mar 7, 2024 03:542,945506,109,656441,818,539016,969,728
3Mar 7, 2024 03:542,953514,250,746442,958,816016,953,344
4Mar 7, 2024 03:542,994472,847,100418,066,00031,004,00017,022,976
5Mar 7, 2024 03:542,997486,598,723422,532,00026,970,00017,068,032
6Mar 7, 2024 03:542,997474,151,808414,571,00034,963,00017,182,720
7Mar 7, 2024 03:543,001473,744,838423,080,00027,005,00017,018,880
8Mar 7, 2024 03:543,001473,648,913417,097,00033,007,00017,039,360
9Mar 7, 2024 03:543,004477,132,865420,569,00029,969,00017,043,456
10Mar 7, 2024 03:543,006475,746,828415,869,00034,988,00017,158,144
11Mar 7, 2024 03:543,008476,658,412423,145,00028,009,00017,203,200
12Mar 7, 2024 03:543,014479,985,222423,086,00029,005,00017,084,416