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 22:03anboto1anboto1Score: 3,145Success
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 22:033,139480,845,585457,432,00013,522,00016,793,600
2Jul 29, 2026 22:033,143481,528,452458,028,00013,514,00016,793,600
3Jul 29, 2026 22:033,143481,462,302458,031,00013,534,00016,793,600
4Jul 29, 2026 22:033,144481,863,843458,119,00013,544,00016,793,600
5Jul 29, 2026 22:033,145481,743,759458,258,00013,494,00016,793,600
6Jul 29, 2026 22:033,147482,211,086458,622,00013,555,00016,793,600
7Jul 29, 2026 22:033,148482,201,623458,636,00013,588,00016,793,600
8Jul 29, 2026 22:033,148482,116,485458,707,00013,501,00016,793,600
9Jul 29, 2026 22:033,148482,256,089458,653,00013,602,00016,793,600