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 09:22anboto1anboto1Score: 43,548Success
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 09:2343,2816,502,421,5416,438,278,00053,932,00017,436,672
2Jun 24, 2026 09:2343,3706,516,382,7536,446,708,00058,861,00017,416,192
3Jun 24, 2026 09:2343,3896,518,503,4016,451,580,00056,912,00017,219,584
4Jun 24, 2026 09:2343,4256,523,641,8576,455,553,00058,265,00017,408,000
5Jun 24, 2026 09:2343,5486,542,155,4946,478,618,00053,667,00017,444,864
6Jun 24, 2026 09:2343,5616,544,126,4486,480,696,00053,534,00017,403,904
7Jun 24, 2026 09:2343,6516,557,516,8746,488,661,00059,045,00017,399,808
8Jun 24, 2026 09:2343,6726,560,856,3006,497,606,00053,278,00017,432,576
9Jun 24, 2026 09:2343,7396,570,745,2996,501,052,00059,901,00017,518,592