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 listJun 17, 2026 16:46Victor MerckléVictor MerckléScore: 1,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 16:471,656257,630,587240,897,0007,625,00016,797,696
2Jun 17, 2026 16:471,657257,749,835240,896,0007,677,00016,797,696
3Jun 17, 2026 16:471,657257,828,495240,946,0007,753,00016,797,696
4Jun 17, 2026 16:471,658257,895,489241,035,0007,727,00016,797,696
5Jun 17, 2026 16:471,658257,937,505241,175,0007,654,00016,797,696
6Jun 17, 2026 16:471,659258,070,033241,103,0007,857,00016,797,696
7Jun 17, 2026 16:471,663258,630,966241,785,0007,754,00016,797,696
8Jun 17, 2026 16:471,664258,797,013241,786,0007,824,00016,797,696
9Jun 17, 2026 16:471,665258,921,377242,041,0007,776,00016,797,696