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 listSep 4, 2026 07:18Victor MerckléVictor MerckléScore: 1,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 07:241,580245,561,808232,915,0004,114,00016,801,792stderr
2Sep 4, 2026 07:241,581245,735,939233,054,0004,109,00016,801,792stderr
3Sep 4, 2026 07:241,581247,742,795232,958,0004,209,00016,801,792stderr
4Sep 4, 2026 07:241,583245,945,234233,242,0004,240,00016,801,792stderr
5Sep 4, 2026 07:241,583246,064,598233,318,0004,210,00016,801,792stderr
6Sep 4, 2026 07:241,583246,065,415233,268,0004,197,00016,801,792stderr
7Sep 4, 2026 07:241,584246,262,310233,523,0004,174,00016,801,792stderr
8Sep 4, 2026 07:241,584246,052,644233,391,0004,229,00016,801,792stderr
9Sep 4, 2026 07:241,586246,785,703233,671,0004,279,00016,801,792stderr