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 6, 2024 16:11Huy Duc LeHuy Duc LeScore: 3,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 16:113,132535,371,098469,731,262016,912,384
2Mar 6, 2024 16:113,132525,402,354469,858,777016,912,384
3Mar 6, 2024 16:113,149546,269,434472,286,025016,920,576
4Mar 6, 2024 16:113,179504,493,566447,910,00028,994,00017,108,992
5Mar 6, 2024 16:113,188505,393,301445,134,00033,009,00017,104,896
6Mar 6, 2024 16:113,199503,574,430449,857,00029,990,00017,104,896
7Mar 6, 2024 16:113,201504,535,683448,075,00032,005,00017,039,360
8Mar 6, 2024 16:113,201500,954,185453,108,00027,006,00017,096,704
9Mar 6, 2024 16:113,219505,160,185452,836,00029,989,00017,100,800
10Mar 6, 2024 16:113,224506,766,178453,562,00029,971,00017,108,992
11Mar 6, 2024 16:113,226513,017,561455,883,00027,992,00017,092,608
12Mar 6, 2024 16:113,248509,437,280458,126,00029,008,00017,092,608