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 listNov 4, 2026 00:16Andrew EpsteinAndrew EpsteinScore: 9,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 00:179,5151,436,714,8891,399,841,00027,442,00016,801,792stderr
2Nov 4, 2026 00:179,5151,438,955,7121,399,703,00027,573,00016,801,792stderr
3Nov 4, 2026 00:179,5161,437,127,8361,400,123,00027,339,00016,801,792stderr
4Nov 4, 2026 00:179,5171,437,402,1771,400,144,00027,427,00016,801,792stderr
5Nov 4, 2026 00:179,5181,437,133,4341,400,294,00027,447,00016,801,792stderr
6Nov 4, 2026 00:179,5201,437,689,2201,400,506,00027,621,00016,801,792stderr
7Nov 4, 2026 00:179,5371,440,053,9691,402,988,00027,615,00016,801,792stderr
8Nov 4, 2026 00:179,5381,440,720,0531,403,155,00027,683,00016,801,792stderr
9Nov 4, 2026 00:179,5401,440,868,5461,403,294,00027,714,00016,801,792stderr