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 17:44anboto1anboto1Score: 2,592Success
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 17:452,588398,459,333377,993,00010,321,00016,793,600
2Jul 29, 2026 17:452,592398,875,548378,549,00010,345,00016,793,600
3Jul 29, 2026 17:452,592400,249,058378,468,00010,462,00016,793,600
4Jul 29, 2026 17:452,592398,920,560378,505,00010,385,00016,793,600
5Jul 29, 2026 17:452,592398,866,012378,314,00010,513,00016,793,600
6Jul 29, 2026 17:452,593399,123,242378,647,00010,384,00016,793,600
7Jul 29, 2026 17:452,595399,333,258378,858,00010,455,00016,793,600
8Jul 29, 2026 17:452,597399,720,997379,163,00010,441,00016,793,600
9Jul 29, 2026 17:452,597400,272,271379,195,00010,498,00016,793,600