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 01:05e1011e1011Score: 24,333Success
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 01:0524,3223,659,427,5383,625,970,00022,478,00016,793,600
2Oct 21, 2026 01:0524,3263,659,842,1053,626,638,00022,310,00016,793,600
3Oct 21, 2026 01:0524,3283,660,116,5313,626,870,00022,441,00016,793,600
4Oct 21, 2026 01:0524,3303,660,591,3533,627,023,00022,485,00016,793,600
5Oct 21, 2026 01:0524,3333,660,948,6353,627,472,00022,613,00016,793,600
6Oct 21, 2026 01:0524,3443,662,595,5163,629,467,00022,187,00016,793,600
7Oct 21, 2026 01:0524,3793,667,749,5593,634,187,00022,708,00016,793,600
8Oct 21, 2026 01:0524,3873,669,085,8383,635,594,00022,602,00016,793,600
9Oct 21, 2026 01:0524,4063,671,858,5573,636,361,00024,586,00016,793,600