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 20:10gchebanovgchebanovScore: 4,080Success
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 20:104,063634,262,031586,527,00022,981,00016,977,920
2Jul 12, 2023 20:104,075683,538,330611,246,163016,953,344
3Jul 12, 2023 20:104,076669,724,288611,353,607016,941,056
4Jul 12, 2023 20:104,077672,533,169611,528,758016,936,960
5Jul 12, 2023 20:104,077633,719,187584,559,00026,979,00017,133,568
6Jul 12, 2023 20:104,078635,361,280584,772,00026,989,00016,982,016
7Jul 12, 2023 20:104,080647,567,809591,041,00021,001,00017,022,976
8Jul 12, 2023 20:104,080635,196,812583,056,00029,002,00016,965,632
9Jul 12, 2023 20:104,087636,785,307589,091,00024,003,00016,977,920
10Jul 12, 2023 20:104,094641,876,293588,035,00026,001,00016,965,632
11Jul 12, 2023 20:104,097643,004,342588,627,00025,983,00017,014,784
12Jul 12, 2023 20:104,099643,390,655594,856,00019,995,00016,977,920