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:46gchebanovgchebanovScore: 4,432Success
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:464,402717,280,747660,336,725016,932,864
2Jul 12, 2023 20:464,412734,912,096661,756,641016,912,384
3Jul 12, 2023 20:464,424688,273,911632,564,00030,978,00017,154,048
4Jul 12, 2023 20:464,427690,791,434636,053,00028,002,00016,969,728
5Jul 12, 2023 20:464,429687,562,244637,403,00026,974,00016,957,440
6Jul 12, 2023 20:464,431689,582,886637,604,00026,983,00017,145,856
7Jul 12, 2023 20:464,432691,968,201638,761,00025,990,00017,072,128
8Jul 12, 2023 20:464,434695,935,049635,118,00030,005,00017,190,912
9Jul 12, 2023 20:464,435693,833,941643,318,00021,976,00017,162,240
10Jul 12, 2023 20:464,441701,692,575637,161,00029,007,00017,068,032
11Jul 12, 2023 20:464,446733,073,726666,869,542016,916,480
12Jul 12, 2023 20:464,448696,134,595643,293,00023,973,00017,162,240