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 listAug 30, 2026 19:13Victor MerckléVictor MerckléScore: 1,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:181,610249,914,625233,294,0008,213,00016,814,080stderr
2Aug 30, 2026 19:181,611250,187,548233,573,0008,189,00016,814,080stderr
3Aug 30, 2026 19:181,611249,976,084233,504,0008,207,00016,932,864stderr
4Aug 30, 2026 19:181,611250,056,536233,498,0008,232,00016,814,080stderr
5Aug 30, 2026 19:181,611249,969,474233,626,0008,152,00016,932,864stderr
6Aug 30, 2026 19:181,612250,048,032233,613,0008,266,00016,814,080stderr
7Aug 30, 2026 19:181,613250,426,349233,828,0008,243,00016,814,080stderr
8Aug 30, 2026 19:181,613250,170,707233,728,0008,240,00016,932,864stderr
9Aug 30, 2026 19:181,629255,224,690236,168,0008,275,00016,932,864stderr