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 listJul 14, 2026 10:21Victor MerckléVictor MerckléScore: 1,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 10:221,651257,343,743239,902,0007,790,00016,801,792stderr
2Jul 14, 2026 10:221,651257,384,276239,966,0007,808,00016,801,792stderr
3Jul 14, 2026 10:221,653257,669,156240,102,0007,934,00016,801,792stderr
4Jul 14, 2026 10:221,653257,731,051240,195,0007,847,00016,801,792stderr
5Jul 14, 2026 10:221,654257,799,164240,231,0007,949,00016,801,792stderr
6Jul 14, 2026 10:221,654258,364,755240,162,0007,989,00016,801,792stderr
7Jul 14, 2026 10:221,656258,022,594240,606,0007,898,00016,801,792stderr
8Jul 14, 2026 10:221,658258,371,640240,763,0008,014,00016,801,792stderr
9Jul 14, 2026 10:221,659258,481,544240,819,0008,057,00016,801,792stderr