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 21, 2026 13:55Andrew EpsteinAndrew EpsteinScore: 2,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 13:552,085322,959,349296,664,00016,088,00016,797,696stderr
2Sep 21, 2026 13:552,086323,236,892296,713,00016,301,00016,797,696stderr
3Sep 21, 2026 13:552,087324,461,229296,972,00016,222,00016,797,696stderr
4Sep 21, 2026 13:552,087323,533,297296,859,00016,326,00016,797,696stderr
5Sep 21, 2026 13:552,089323,751,883296,965,00016,487,00016,797,696stderr
6Sep 21, 2026 13:552,089325,018,778297,256,00016,232,00016,797,696stderr
7Sep 21, 2026 13:552,091323,927,665297,439,00016,216,00016,797,696stderr
8Sep 21, 2026 13:552,092324,107,626297,504,00016,389,00016,797,696stderr
9Sep 21, 2026 13:552,096325,336,743298,035,00016,373,00016,797,696stderr