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 listJan 4, 2026 18:19Josu San MartinJosu San MartinScore: 3,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 02:173,519556,006,547489,802,00037,984,00017,190,912
2Jan 5, 2026 02:173,525555,748,973488,770,00039,981,00017,022,976
3Jan 5, 2026 02:173,525559,361,489489,813,00038,985,00016,969,728
4Jan 4, 2026 18:193,533554,881,419488,893,00040,991,00016,973,824
5Jan 4, 2026 18:193,533557,510,461486,939,00042,994,00017,027,072
6Jan 4, 2026 18:193,535559,472,530495,322,00034,952,00016,953,344