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 03:56Huy Duc LeHuy Duc LeScore: 3,011Success
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 03:562,943517,570,664441,459,702016,965,632
2Mar 7, 2024 03:562,947493,361,595442,024,169016,961,536
3Mar 7, 2024 03:562,951513,938,952442,598,582016,969,728
4Mar 7, 2024 03:563,007472,319,181421,115,00030,008,00017,027,072
5Mar 7, 2024 03:563,009478,426,712424,338,00027,021,00017,027,072
6Mar 7, 2024 03:563,011478,659,887420,704,00030,978,00017,117,184
7Mar 7, 2024 03:563,011479,130,787415,726,00035,976,00017,027,072
8Mar 7, 2024 03:563,012475,038,281416,832,00034,985,00017,174,528
9Mar 7, 2024 03:563,017477,817,050422,552,00029,968,00017,018,880
10Mar 7, 2024 03:563,019476,396,876424,802,00027,986,00017,035,264
11Mar 7, 2024 03:563,019478,296,073421,849,00030,988,00017,002,496
12Mar 7, 2024 03:563,024480,887,950424,680,00028,978,00017,133,568