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 19, 2026 13:28Andrew EpsteinAndrew EpsteinScore: 3,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 13:403,461529,564,886492,310,00026,969,00016,809,984stderr
2Sep 19, 2026 13:403,462529,513,455492,676,00026,676,00016,809,984stderr
3Sep 19, 2026 13:403,479532,349,933494,512,00027,472,00016,809,984stderr
4Sep 19, 2026 13:403,482532,668,708495,466,00026,893,00016,809,984stderr
5Sep 19, 2026 13:403,485533,046,834494,626,00028,170,00016,809,984stderr
6Sep 19, 2026 13:403,488533,429,104496,645,00026,586,00016,805,888stderr
7Sep 19, 2026 13:403,517538,016,634500,807,00026,891,00016,809,984stderr
8Sep 19, 2026 13:403,528539,493,820502,735,00026,508,00016,805,888stderr
9Sep 19, 2026 13:403,537540,813,107503,219,00027,373,00016,809,984stderr