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:58gchebanovgchebanovScore: 4,190Success
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:584,151695,552,465622,693,401016,928,768
2Jul 12, 2023 22:584,154690,030,944623,165,308016,920,576
3Jul 12, 2023 22:584,156701,732,636623,352,874016,928,768
4Jul 12, 2023 22:584,182657,447,938606,280,00021,009,00017,182,720
5Jul 12, 2023 22:584,185648,669,717600,815,00026,991,00017,051,648
6Jul 12, 2023 22:584,188650,516,831605,241,00023,009,00017,014,784
7Jul 12, 2023 22:584,190651,897,220602,577,00025,981,00017,055,744
8Jul 12, 2023 22:584,192655,658,846600,793,00027,990,00017,088,512
9Jul 12, 2023 22:584,193654,153,598602,918,00025,996,00017,088,512
10Jul 12, 2023 22:584,199651,443,605602,909,00026,995,00017,068,032
11Jul 12, 2023 22:584,204654,646,420604,611,00025,983,00017,137,664
12Jul 12, 2023 22:584,205658,198,874605,706,00024,987,00016,965,632