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 26, 2026 16:49Victor MerckléVictor MerckléScore: 1,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:521,849285,949,523272,469,0005,008,00017,092,608
2Apr 26, 2026 16:521,854287,097,306269,213,0008,973,00017,084,416
3Apr 26, 2026 16:521,855286,837,345271,338,0007,008,00017,092,608
4Apr 26, 2026 16:521,856287,054,119270,545,0007,986,00017,039,360
5Apr 26, 2026 16:521,856286,905,317273,394,0005,007,00017,084,416
6Apr 26, 2026 16:521,857287,113,181269,579,0008,985,00017,080,320
7Apr 26, 2026 16:521,860286,727,591269,144,00010,005,00017,096,704
8Apr 26, 2026 16:521,860286,727,928270,046,0009,001,00017,080,320
9Apr 26, 2026 16:521,861286,906,284271,206,0008,035,00017,080,320