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 22, 2026 11:29olliecrowolliecrowScore: 3,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 11:303,477540,640,010516,566,0004,995,00017,039,360
2Apr 22, 2026 11:303,478539,900,753517,776,0003,998,00017,088,512
3Apr 22, 2026 11:303,478539,051,290515,715,0005,996,00017,002,496
4Apr 22, 2026 11:303,479547,585,929517,893,0003,999,00017,055,744
5Apr 22, 2026 11:303,480536,282,287517,147,0005,001,00017,043,456
6Apr 22, 2026 11:303,484545,889,684517,622,0004,996,00017,129,472
7Apr 22, 2026 11:303,485540,487,344519,861,0002,999,00017,051,648
8Apr 22, 2026 11:303,487540,859,539518,164,0005,001,00017,039,360
9Apr 22, 2026 11:303,493545,253,223522,981,000999,00017,031,168