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:02anboto1anboto1Score: 3,132Success
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:033,126479,179,835455,833,00013,189,00016,793,600
2Jul 29, 2026 21:033,127479,009,421455,860,00013,248,00016,793,600
3Jul 29, 2026 21:033,130480,925,324456,179,00013,416,00016,793,600
4Jul 29, 2026 21:033,130479,702,122456,510,00013,105,00016,793,600
5Jul 29, 2026 21:033,132480,051,454456,767,00013,175,00016,793,600
6Jul 29, 2026 21:033,132479,855,526456,596,00013,281,00016,793,600
7Jul 29, 2026 21:033,133480,030,095456,862,00013,233,00016,793,600
8Jul 29, 2026 21:033,134480,093,720456,952,00013,246,00016,793,600
9Jul 29, 2026 21:033,144481,644,640458,524,00013,203,00016,793,600