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 11:35anboto1anboto1Score: 7,267Success
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 11:357,2461,096,281,0971,067,210,00019,797,00016,793,600
2Jun 24, 2026 11:357,2551,097,710,9591,067,869,00020,417,00016,793,600
3Jun 24, 2026 11:357,2611,098,292,8311,069,478,00019,760,00016,793,600
4Jun 24, 2026 11:357,2661,099,140,3441,070,009,00020,003,00016,793,600
5Jun 24, 2026 11:357,2671,099,209,0851,070,062,00020,024,00016,793,600
6Jun 24, 2026 11:357,2671,099,247,9071,070,131,00019,927,00016,793,600
7Jun 24, 2026 11:357,2721,100,188,6011,071,025,00019,902,00016,793,600
8Jun 24, 2026 11:357,2741,100,413,7911,071,139,00020,105,00016,793,600
9Jun 24, 2026 11:357,2751,100,620,5891,071,364,00019,982,00016,793,600