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 listApr 25, 2026 21:13Victor MerckléVictor MerckléScore: 16,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 21:1416,2322,453,284,9432,412,941,00021,963,00017,002,496stderr
2Apr 25, 2026 21:1416,2762,464,709,5152,429,535,00011,977,00017,211,392stderr
3Apr 25, 2026 21:1416,2762,461,695,5572,419,463,00021,967,00017,002,496stderr
4Apr 25, 2026 21:1416,2852,466,286,8582,423,879,00018,967,00017,002,496stderr
5Apr 25, 2026 21:1416,2892,469,492,1132,425,525,00017,966,00017,002,496stderr
6Apr 25, 2026 21:1416,3012,464,065,3752,424,282,00020,967,00017,215,488stderr
7Apr 25, 2026 21:1416,3822,480,292,5882,439,346,00017,965,00017,002,496stderr
8Apr 25, 2026 21:1416,4312,491,934,1692,447,769,00016,970,00017,211,392stderr
9Apr 25, 2026 21:1416,4382,492,708,4492,441,858,00023,959,00017,207,296stderr