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 listJul 29, 2026 18:37anboto1anboto1Score: 2,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 18:372,534390,260,889365,206,00014,907,00016,793,600
2Jul 29, 2026 18:372,534391,160,723364,939,00015,231,00016,793,600
3Jul 29, 2026 18:372,534392,274,110365,323,00014,906,00016,793,600
4Jul 29, 2026 18:372,534390,427,493365,281,00014,923,00016,793,600
5Jul 29, 2026 18:372,535390,690,638364,969,00015,327,00016,793,600
6Jul 29, 2026 18:372,536390,758,481365,539,00014,977,00016,793,600
7Jul 29, 2026 18:372,538390,999,902365,626,00015,136,00016,793,600
8Jul 29, 2026 18:372,539391,097,959365,959,00014,996,00016,793,600
9Jul 29, 2026 18:372,542391,675,329366,227,00015,153,00016,793,600