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:29anboto1anboto1Score: 23,716Success
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:2923,4223,522,656,6463,492,091,00021,345,00016,793,600
2Jun 24, 2026 10:2923,4543,527,445,4573,496,708,00021,452,00016,793,600
3Jun 24, 2026 10:2923,6563,557,641,6703,527,198,00021,239,00016,793,600
4Jun 24, 2026 10:2923,6743,560,435,8983,529,790,00021,455,00016,793,600
5Jun 24, 2026 10:2923,7163,566,771,1183,535,464,00022,059,00016,793,600
6Jun 24, 2026 10:2923,7203,568,566,7733,536,395,00021,688,00016,793,600
7Jun 24, 2026 10:2923,7603,573,373,0673,542,158,00021,956,00016,793,600
8Jun 24, 2026 10:2923,7923,578,205,0633,546,569,00022,301,00016,793,600
9Jun 24, 2026 10:2923,9753,605,503,1503,575,196,00021,105,00016,793,600