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 listJun 24, 2026 12:45anboto1anboto1Score: 3,129Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 12:453,115476,598,797441,941,00025,408,00016,793,600
2Jun 24, 2026 12:453,116476,869,093442,160,00025,361,00016,793,600
3Jun 24, 2026 12:453,118477,022,826442,138,00025,671,00016,793,600
4Jun 24, 2026 12:453,126478,103,771443,423,00025,522,00016,793,600
5Jun 24, 2026 12:453,129478,563,921443,674,00025,773,00016,793,600
6Jun 24, 2026 12:453,132478,984,868444,132,00025,759,00016,793,600
7Jun 24, 2026 12:453,139480,009,928444,718,00026,193,00016,793,600
8Jun 24, 2026 12:453,141480,427,579445,419,00025,821,00016,793,600
9Jun 24, 2026 12:453,144482,038,117445,757,00025,901,00016,793,600