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 listMar 27, 2026 16:51Dominique GarmierDominique GarmierScore: 32,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 17:1732,4774,899,979,3064,857,590,00013,993,00017,231,872
2Mar 27, 2026 17:1732,4824,902,121,5774,857,380,00014,991,00017,219,584
3Mar 27, 2026 16:5132,4834,904,430,3634,859,417,00012,993,00017,223,680
4Mar 27, 2026 16:5132,4894,905,992,4574,860,343,00012,992,00017,022,976
5Mar 27, 2026 17:1732,4894,901,458,5434,864,415,0008,995,00017,227,776
6Mar 27, 2026 16:5132,5594,916,043,6314,870,847,00012,999,00017,039,360