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 17:09Andrew EpsteinAndrew EpsteinScore: 1,593Success
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 17:101,590247,320,335234,341,0004,236,00016,793,600
2Sep 21, 2026 17:101,591248,234,398234,487,0004,265,00016,793,600
3Sep 21, 2026 17:101,592248,270,862234,597,0004,210,00016,793,600
4Sep 21, 2026 17:101,592248,221,387234,660,0004,233,00016,793,600
5Sep 21, 2026 17:101,593248,433,297234,719,0004,255,00016,793,600
6Sep 21, 2026 17:101,594248,543,886234,806,0004,400,00016,793,600
7Sep 21, 2026 17:101,596248,828,239235,212,0004,259,00016,793,600
8Sep 21, 2026 17:101,596248,874,346235,418,0004,095,00016,793,600
9Sep 21, 2026 17:101,598249,091,599235,470,0004,251,00016,793,600