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 listApr 19, 2023 03:13Yuriy LyfenkoYuriy LyfenkoScore: 3,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2023 03:133,924659,124,671588,640,905016,949,248
2Apr 19, 2023 03:133,924649,658,823588,665,108016,941,056
3Apr 19, 2023 03:133,930660,395,755589,425,342017,018,880
4Apr 19, 2023 03:133,941620,702,501568,177,00023,007,00017,104,896
5Apr 19, 2023 03:133,942615,288,100567,248,00024,010,00017,055,744
6Apr 19, 2023 03:133,942621,927,378565,292,00026,013,00016,973,824
7Apr 19, 2023 03:133,942622,555,028570,322,00021,011,00016,969,728
8Apr 19, 2023 03:133,944617,164,609564,614,00026,981,00017,125,376
9Apr 19, 2023 03:133,944614,262,993566,680,00024,985,00017,084,416
10Apr 19, 2023 03:133,946616,655,275567,886,00023,995,00016,957,440
11Apr 19, 2023 03:133,948615,552,946565,151,00027,007,00016,969,728
12Apr 19, 2023 03:133,955624,820,460566,341,00026,968,00016,969,728