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 listMay 5, 2026 08:02olliecrowolliecrowScore: 3,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 08:023,159492,855,529469,470,0004,473,00017,141,760
2May 5, 2026 08:023,159489,987,283469,364,0004,598,00017,149,952
3May 5, 2026 08:023,160491,213,054469,471,0004,584,00017,145,856
4May 5, 2026 08:023,160488,780,525469,715,0004,416,00017,141,760
5May 5, 2026 08:023,162491,186,145469,760,0004,595,00017,154,048
6May 5, 2026 08:023,162491,165,966469,805,0004,565,00017,154,048
7May 5, 2026 08:023,164489,837,539470,515,0004,220,00017,137,664
8May 5, 2026 08:023,164489,740,281470,466,0004,144,00017,141,760
9May 5, 2026 08:023,167492,273,701470,381,0004,780,00017,154,048