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:53e1011e1011Score: 16,293Success
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:5416,2762,452,528,1632,424,282,00017,131,00016,793,600
2Oct 21, 2026 03:5416,2832,453,631,7762,425,655,00016,875,00016,793,600
3Oct 21, 2026 03:5416,2842,453,586,8042,425,608,00017,063,00016,793,600
4Oct 21, 2026 03:5416,2882,454,380,0282,425,934,00017,332,00016,793,600
5Oct 21, 2026 03:5416,2932,454,935,4352,426,777,00017,214,00016,793,600
6Oct 21, 2026 03:5416,3002,455,835,9862,427,709,00017,313,00016,793,600
7Oct 21, 2026 03:5416,3042,456,504,6472,428,678,00017,016,00016,793,600
8Oct 21, 2026 03:5416,3362,461,508,5482,432,988,00017,442,00016,793,600
9Oct 21, 2026 03:5416,5022,486,220,0812,457,588,00017,713,00016,793,600