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 listJan 2, 2024 18:41Yurkov AlekseyYurkov AlekseyScore: 3,947Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2024 18:413,941623,565,284578,210,00013,004,00017,047,552
2Jan 2, 2024 18:413,944614,689,056577,585,00013,989,00016,973,824
3Jan 2, 2024 18:413,944619,154,757582,623,0008,994,00016,973,824
4Jan 2, 2024 18:413,944615,110,675580,672,00010,993,00017,145,856
5Jan 2, 2024 18:413,945617,134,675581,785,0009,996,00017,154,048
6Jan 2, 2024 18:413,946618,156,495573,933,00017,997,00017,145,856
7Jan 2, 2024 18:413,947618,643,299578,980,00012,999,00017,190,912
8Jan 2, 2024 18:413,947623,364,615581,033,00011,000,00017,059,840
9Jan 2, 2024 18:413,947621,836,542579,111,00013,002,00017,022,976
10Jan 2, 2024 18:413,949647,922,219592,276,094016,936,960
11Jan 2, 2024 18:413,949659,870,298592,344,059016,941,056
12Jan 2, 2024 18:413,952655,395,559592,727,593016,949,248