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 listOct 21, 2026 03:48e1011e1011Score: 22,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 03:4922,8613,440,166,8293,412,414,00016,866,00016,793,600
2Oct 21, 2026 03:4922,8733,441,845,8813,414,094,00016,856,00016,793,600
3Oct 21, 2026 03:4922,8783,442,688,7533,414,779,00016,939,00016,793,600
4Oct 21, 2026 03:4922,8913,444,804,1623,416,811,00016,915,00016,793,600
5Oct 21, 2026 03:4922,8963,445,532,4423,417,489,00016,948,00016,793,600
6Oct 21, 2026 03:4922,9303,450,319,1493,422,620,00016,928,00016,793,600
7Oct 21, 2026 03:4922,9323,450,982,0553,422,907,00016,994,00016,793,600
8Oct 21, 2026 03:4922,9423,452,119,1443,424,414,00016,913,00016,793,600
9Oct 21, 2026 03:4922,9863,458,827,9473,431,118,00016,891,00016,793,600