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 listSep 21, 2026 17:31Andrew EpsteinAndrew EpsteinScore: 1,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 17:321,576245,383,424232,283,0004,232,00016,793,600
2Sep 21, 2026 17:321,576245,945,876232,174,0004,347,00016,793,600
3Sep 21, 2026 17:321,577245,984,728232,182,0004,374,00016,793,600
4Sep 21, 2026 17:321,577246,117,384232,248,0004,390,00016,793,600
5Sep 21, 2026 17:321,577246,017,958232,504,0004,084,00016,793,600
6Sep 21, 2026 17:321,578246,170,915232,345,0004,358,00016,793,600
7Sep 21, 2026 17:321,580246,375,108232,765,0004,250,00016,793,600
8Sep 21, 2026 17:321,580246,472,895232,834,0004,254,00016,793,600
9Sep 21, 2026 17:321,581245,757,141232,944,0004,276,00016,793,600