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 21:47gchebanovgchebanovScore: 4,257Success
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 21:474,235701,367,802635,178,851016,928,768
2Jul 12, 2023 21:474,237715,423,656635,550,843016,936,960
3Jul 12, 2023 21:474,245664,565,045610,693,00025,986,00017,080,320
4Jul 12, 2023 21:474,249670,201,613611,363,00026,015,00017,080,320
5Jul 12, 2023 21:474,250664,076,594613,461,00023,978,00017,195,008
6Jul 12, 2023 21:474,252700,069,941637,762,957016,920,576
7Jul 12, 2023 21:474,257663,439,596609,525,00028,977,00016,986,112
8Jul 12, 2023 21:474,263662,680,215608,500,00030,974,00016,982,016
9Jul 12, 2023 21:474,267663,008,735615,978,00023,999,00017,018,880
10Jul 12, 2023 21:474,267666,976,415612,978,00026,999,00017,072,128
11Jul 12, 2023 21:474,267665,517,826611,028,00029,001,00017,014,784
12Jul 12, 2023 21:474,274664,038,600616,058,00025,002,00017,022,976