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 listOct 21, 2026 06:07e1011e1011Score: 56,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 06:1356,1928,439,843,7188,411,583,00017,336,00016,793,600
2Oct 21, 2026 06:1356,1948,440,406,3658,411,698,00017,470,00016,793,600
3Oct 21, 2026 06:1356,1958,440,398,6538,412,213,00017,172,00016,793,600
4Oct 21, 2026 06:1356,1958,440,417,6798,411,881,00017,470,00016,793,600
5Oct 21, 2026 06:1356,1958,440,338,8078,412,067,00017,284,00016,793,600
6Oct 21, 2026 06:1356,1968,440,743,0598,411,917,00017,485,00016,793,600
7Oct 21, 2026 06:1356,2018,441,244,7518,412,753,00017,509,00016,793,600
8Oct 21, 2026 06:1356,2048,443,337,2168,413,189,00017,549,00016,793,600
9Oct 21, 2026 06:1356,2218,444,457,2128,415,786,00017,473,00016,793,600