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 listAug 23, 2026 15:20Andrew EpsteinAndrew EpsteinScore: 4,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 15:204,329659,381,919640,649,0008,811,00016,793,600
2Aug 23, 2026 15:204,330659,614,532640,720,0008,889,00016,793,600
3Aug 23, 2026 15:204,332659,783,524641,089,0008,860,00016,793,600
4Aug 23, 2026 15:204,334660,039,713640,981,0009,157,00016,793,600
5Aug 23, 2026 15:204,335660,239,866641,426,0008,892,00016,793,600
6Aug 23, 2026 15:204,335661,100,427641,369,0009,017,00016,793,600
7Aug 23, 2026 15:204,340660,971,321642,153,0008,964,00016,793,600
8Aug 23, 2026 15:204,344661,663,019642,737,0009,010,00016,793,600
9Aug 23, 2026 15:204,344661,577,185642,720,0008,985,00016,793,600