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 listJul 12, 2023 22:45gchebanovgchebanovScore: 4,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 22:454,045679,666,176606,768,216016,965,632
2Jul 12, 2023 22:454,047671,543,628607,004,678016,957,440
3Jul 12, 2023 22:454,047675,618,595607,067,470016,961,536
4Jul 12, 2023 22:454,058635,484,366586,649,00021,986,00016,973,824
5Jul 12, 2023 22:454,065632,385,069587,752,00021,990,00016,977,920
6Jul 12, 2023 22:454,066629,871,665582,847,00026,992,00017,186,816
7Jul 12, 2023 22:454,068636,045,708588,235,00022,008,00017,092,608
8Jul 12, 2023 22:454,069639,850,524580,323,00030,016,00016,982,016
9Jul 12, 2023 22:454,069637,561,600589,443,00020,980,00017,084,416
10Jul 12, 2023 22:454,071638,866,572589,634,00020,986,00017,039,360
11Jul 12, 2023 22:454,071634,938,663581,705,00028,985,00017,076,224
12Jul 12, 2023 22:454,082649,662,085585,285,00027,013,00017,022,976