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 22:27Aleksei ShahoikaAleksei ShahoikaScore: 3,517Success
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 22:283,511537,165,381519,448,0007,274,00016,793,600
2May 13, 2026 22:283,512537,336,019519,520,0007,425,00016,793,600
3May 13, 2026 22:283,514544,681,115519,927,0007,305,00016,793,600
4May 13, 2026 22:283,516538,627,808519,963,0007,580,00016,793,600
5May 13, 2026 22:283,517537,876,122520,323,0007,270,00016,793,600
6May 13, 2026 22:283,517537,386,090520,044,0007,542,00016,793,600
7May 13, 2026 22:283,518538,411,133520,171,0007,577,00016,793,600
8May 13, 2026 22:283,518536,953,240520,203,0007,519,00016,793,600
9May 13, 2026 22:283,531540,304,284522,368,0007,283,00016,793,600