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 16:22anboto1anboto1Score: 3,027Success
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 16:233,004460,815,879438,665,00011,961,00016,793,600
2Jul 29, 2026 16:233,006462,482,175439,007,00012,014,00016,793,600
3Jul 29, 2026 16:233,013462,252,802440,060,00011,986,00016,793,600
4Jul 29, 2026 16:233,017463,042,042440,634,00012,025,00016,793,600
5Jul 29, 2026 16:233,027464,919,816441,779,00012,373,00016,793,600
6Jul 29, 2026 16:233,035465,648,735442,922,00012,428,00016,793,600
7Jul 29, 2026 16:233,036465,675,596443,046,00012,426,00016,793,600
8Jul 29, 2026 16:233,866590,195,424567,438,00012,578,00016,793,600
9Jul 29, 2026 16:235,336810,780,291788,502,00012,041,00016,793,600