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 28, 2026 15:11Charles CabergsCharles CabergsScore: 3,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 15:123,832591,243,769564,832,0009,997,00016,973,824
2Apr 28, 2026 15:123,832591,932,517565,947,0008,999,00017,092,608
3Apr 28, 2026 15:123,833592,382,240566,069,0009,001,00017,096,704
4Apr 28, 2026 15:123,833592,752,951565,964,0008,999,00017,084,416
5Apr 28, 2026 15:123,834592,410,243565,170,00010,003,00017,080,320
6Apr 28, 2026 15:123,834599,450,267566,125,0009,002,00017,096,704
7Apr 28, 2026 15:123,835589,333,419568,279,0007,003,00017,096,704
8Apr 28, 2026 15:123,835592,122,157565,410,0009,989,00017,096,704
9Apr 28, 2026 15:123,841592,161,743566,247,00010,004,00017,227,776