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 listSep 21, 2026 13:40Andrew EpsteinAndrew EpsteinScore: 28,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 13:4228,6244,304,517,5903,979,025,000314,613,00016,797,696stderr
2Sep 21, 2026 13:4228,6564,309,276,9773,992,362,000306,174,00016,797,696stderr
3Sep 21, 2026 13:4228,6714,311,998,3153,996,694,000304,082,00016,797,696stderr
4Sep 21, 2026 13:4228,6714,311,428,5703,996,349,000304,369,00016,797,696stderr
5Sep 21, 2026 13:4228,6864,314,321,0593,997,634,000305,271,00016,797,696stderr
6Sep 21, 2026 13:4228,7054,316,959,5823,995,479,000310,285,00016,797,696stderr
7Sep 21, 2026 13:4228,7074,316,716,2783,999,587,000306,520,00016,797,696stderr
8Sep 21, 2026 13:4228,7974,331,355,5234,003,183,000316,435,00016,797,696stderr
9Sep 21, 2026 13:4229,0504,368,247,2014,048,087,000309,512,00016,797,696stderr