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 14:36Andrew EpsteinAndrew EpsteinScore: 1,738Success
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 14:371,736270,881,879253,963,0006,583,00016,793,600
2Sep 21, 2026 14:371,737270,920,161253,327,0007,274,00016,793,600
3Sep 21, 2026 14:371,737270,906,554253,232,0007,342,00016,793,600
4Sep 21, 2026 14:371,737271,593,635253,288,0007,385,00016,793,600
5Sep 21, 2026 14:371,738270,959,718254,100,0006,615,00016,793,600
6Sep 21, 2026 14:371,739271,214,743254,315,0006,672,00016,793,600
7Sep 21, 2026 14:371,740271,369,061253,841,0007,206,00016,793,600
8Sep 21, 2026 14:371,740271,285,633254,392,0006,615,00016,793,600
9Sep 21, 2026 14:371,740271,283,094254,334,0006,668,00016,793,600