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 listFeb 18, 2024 03:54Bubble BoiBubble BoiScore: 366,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2024 03:54365,69454,918,691,11254,854,113,795016,953,344
2Feb 18, 2024 04:05365,88954,949,632,63354,883,372,205016,961,536
3Feb 18, 2024 04:05366,67055,047,986,08555,000,545,976016,953,344
4Feb 18, 2024 03:54366,73455,069,941,11055,010,106,705016,949,248
5Feb 18, 2024 03:54366,90255,107,493,19055,035,255,464016,941,056
6Feb 18, 2024 04:05367,34555,147,664,32855,101,763,121016,953,344