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 14:47Victor MerckléVictor MerckléScore: 2,110Success
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 14:472,103335,385,512308,582,0006,990,00017,059,840
2Apr 26, 2026 14:472,107335,487,872309,068,0007,001,00017,149,952
3Apr 26, 2026 14:472,107334,590,286309,135,0007,003,00017,211,392
4Apr 26, 2026 14:472,109335,837,964309,441,0006,987,00017,149,952
5Apr 26, 2026 14:472,110333,147,426309,598,0006,990,00017,145,856
6Apr 26, 2026 14:472,114332,230,772310,126,0007,002,00017,018,880
7Apr 26, 2026 14:472,116335,368,558310,532,0006,989,00017,145,856
8Apr 26, 2026 14:472,117336,427,192311,672,0005,993,00017,137,664
9Apr 26, 2026 14:472,122338,562,161310,334,0007,982,00017,002,496