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 21:51anboto1anboto1Score: 3,107Success
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 21:513,102475,326,364450,342,00015,027,00016,793,600
2Jul 29, 2026 21:513,103478,249,691450,514,00014,956,00016,793,600
3Jul 29, 2026 21:513,106476,626,188450,931,00015,067,00016,793,600
4Jul 29, 2026 21:513,106475,949,835451,123,00014,900,00016,793,600
5Jul 29, 2026 21:513,107476,084,394450,990,00015,093,00016,793,600
6Jul 29, 2026 21:513,107476,179,669451,198,00014,990,00016,793,600
7Jul 29, 2026 21:513,109476,548,965451,237,00015,172,00016,793,600
8Jul 29, 2026 21:513,127479,053,759454,016,00015,118,00016,793,600
9Jul 29, 2026 21:513,136480,417,144455,313,00015,128,00016,793,600