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 listMay 13, 2026 21:33Aleksei ShahoikaAleksei ShahoikaScore: 5,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:335,087773,019,592757,441,0005,751,00016,793,600
2May 13, 2026 21:335,098773,812,665759,924,0004,878,00016,793,600
3May 13, 2026 21:335,098773,771,754759,941,0004,839,00016,793,600
4May 13, 2026 21:335,101773,944,890760,390,0004,798,00016,793,600
5May 13, 2026 21:335,102775,910,834760,430,0004,892,00016,793,600
6May 13, 2026 21:335,147781,014,727767,244,0004,887,00016,793,600
7May 13, 2026 21:335,165783,595,813769,981,0004,889,00016,793,600
8May 13, 2026 21:335,189787,934,948773,572,0004,836,00016,793,600
9May 13, 2026 21:335,191788,627,216773,850,0004,896,00016,793,600