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 06:38Dominique GarmierDominique GarmierScore: 51,163Success
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 08:3450,2537,571,601,6437,522,895,00014,991,00017,133,568
2Mar 27, 2026 08:3450,6477,629,557,9107,581,021,00015,991,00017,219,584
3Mar 27, 2026 06:3850,8927,667,179,8477,619,864,00013,992,00017,154,048
4Mar 27, 2026 06:3851,1637,704,926,6717,657,415,00016,989,00017,002,496
5Mar 27, 2026 06:3851,3727,736,707,9007,691,863,00013,992,00016,994,304
6Mar 27, 2026 08:3451,7117,785,172,6937,743,619,00012,994,00017,022,976