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 listJun 24, 2026 10:08anboto1anboto1Score: 27,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:0927,2944,103,565,0674,071,959,00022,148,00016,793,600
2Jun 24, 2026 10:0927,3294,108,826,8594,077,749,00021,628,00016,793,600
3Jun 24, 2026 10:0927,4114,121,062,0284,090,067,00021,652,00016,793,600
4Jun 24, 2026 10:0927,4544,127,745,8964,096,611,00021,606,00016,793,600
5Jun 24, 2026 10:0927,4834,133,052,1974,100,964,00021,522,00016,793,600
6Jun 24, 2026 10:0927,5134,136,301,4574,105,318,00021,676,00016,793,600
7Jun 24, 2026 10:0927,5344,139,428,0804,108,523,00021,605,00016,793,600
8Jun 24, 2026 10:0927,5684,144,532,6794,113,755,00021,457,00016,793,600
9Jun 24, 2026 10:0927,8034,179,906,9504,148,944,00021,591,00016,793,600