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 04:07e1011e1011Score: 23,328Success
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 04:0923,3143,508,154,7583,486,738,00010,375,00016,793,600
2Oct 21, 2026 04:0923,3193,508,785,5023,487,637,00010,240,00016,793,600
3Oct 21, 2026 04:0923,3233,509,741,4723,488,006,00010,445,00016,793,600
4Oct 21, 2026 04:0923,3263,509,818,1253,488,753,00010,152,00016,793,600
5Oct 21, 2026 04:0923,3283,510,371,9773,488,800,00010,471,00016,793,600
6Oct 21, 2026 04:0923,3283,510,251,1633,489,106,00010,144,00016,793,600
7Oct 21, 2026 04:0923,3303,510,537,4833,489,335,00010,279,00016,793,600
8Oct 21, 2026 04:0923,3323,512,341,4273,489,481,00010,403,00016,793,600
9Oct 21, 2026 04:0923,3333,511,303,0923,489,723,00010,311,00016,793,600