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 27, 2026 13:21Dominique GarmierDominique GarmierScore: 27,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 13:2127,3424,135,482,1334,075,386,00025,957,00017,203,200
2Mar 27, 2026 13:2127,3534,140,712,7684,074,952,00027,951,00017,223,680
3Mar 27, 2026 13:2127,3794,142,554,8804,082,843,00023,963,00017,076,224