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 listJul 29, 2026 23:45anboto1anboto1Score: 3,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 23:463,321508,173,492472,939,00025,256,00016,793,600
2Jul 29, 2026 23:463,323509,213,964472,785,00025,703,00016,793,600
3Jul 29, 2026 23:463,325508,837,249473,545,00025,326,00016,793,600
4Jul 29, 2026 23:463,329509,358,039473,787,00025,592,00016,793,600
5Jul 29, 2026 23:463,332509,681,567474,156,00025,652,00016,793,600
6Jul 29, 2026 23:463,333510,269,222474,051,00026,014,00016,793,600
7Jul 29, 2026 23:463,336510,479,013474,799,00025,678,00016,793,600
8Jul 29, 2026 23:463,339510,937,466474,936,00025,944,00016,793,600
9Jul 29, 2026 23:463,342511,393,268475,594,00025,785,00016,793,600