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 19, 2026 13:21highload-churnerhighload-churnerScore: 1,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 13:211,543241,078,840226,139,0005,460,00016,019,456
2Oct 19, 2026 13:211,549241,727,982227,008,0005,357,00016,019,456
3Oct 19, 2026 13:211,551242,254,754227,391,0005,392,00016,019,456
4Oct 19, 2026 13:211,551242,121,656227,461,0005,302,00016,019,456
5Oct 19, 2026 13:211,552242,460,230227,419,0005,472,00016,019,456
6Oct 19, 2026 13:211,553242,297,128227,663,0005,301,00016,019,456
7Oct 19, 2026 13:211,563243,928,107229,187,0005,343,00016,019,456
8Oct 19, 2026 13:211,569246,696,131230,088,0005,390,00016,019,456
9Oct 19, 2026 13:211,573246,187,052230,708,0005,383,00016,019,456