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 listMar 7, 2024 02:33Huy Duc LeHuy Duc LeScore: 3,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 02:332,961506,076,613444,124,947016,965,632
2Mar 7, 2024 02:332,966501,150,429444,946,636016,961,536
3Mar 7, 2024 02:332,969514,640,645445,313,170016,957,440
4Mar 7, 2024 02:333,011472,858,944415,619,00035,967,00017,129,472
5Mar 7, 2024 02:333,011479,520,874425,638,00025,977,00017,141,760
6Mar 7, 2024 02:333,011478,488,562423,720,00027,981,00017,014,784
7Mar 7, 2024 02:333,012475,592,085425,815,00025,988,00017,141,760
8Mar 7, 2024 02:333,016477,374,728421,494,00030,962,00017,031,168
9Mar 7, 2024 02:333,017475,003,574424,596,00027,973,00017,027,072
10Mar 7, 2024 02:333,018476,274,620427,773,00024,986,00017,022,976
11Mar 7, 2024 02:333,029479,826,326422,401,00031,954,00017,199,104
12Mar 7, 2024 02:333,050485,957,792421,506,00035,957,00017,027,072