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 15:48anboto1anboto1Score: 3,437Success
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 15:493,424523,668,684495,018,00018,615,00016,793,600
2Jul 29, 2026 15:493,426523,959,729495,063,00018,857,00016,793,600
3Jul 29, 2026 15:493,427524,118,602495,406,00018,790,00016,793,600
4Jul 29, 2026 15:493,433525,094,131495,140,00019,847,00016,793,600
5Jul 29, 2026 15:493,437525,641,638496,215,00019,391,00016,793,600
6Jul 29, 2026 15:493,438525,849,660496,308,00019,461,00016,793,600
7Jul 29, 2026 15:493,451527,799,132498,274,00019,406,00016,793,600
8Jul 29, 2026 15:493,451527,762,148498,460,00019,241,00016,793,600
9Jul 29, 2026 15:493,494543,426,931505,433,00018,668,00016,793,600