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 30, 2026 14:27Charles CabergsCharles CabergsScore: 3,816Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 14:283,812590,106,191566,862,0004,998,00016,994,304
2Apr 30, 2026 14:283,813588,821,304565,986,0005,999,00017,010,688
3Apr 30, 2026 14:283,814589,478,009566,145,0006,001,00017,129,472
4Apr 30, 2026 14:283,815588,872,788564,310,0008,004,00017,129,472
5Apr 30, 2026 14:283,816590,140,655566,419,0005,993,00017,121,280
6Apr 30, 2026 14:283,816593,866,892567,509,0004,995,00017,121,280
7Apr 30, 2026 14:283,819591,148,994566,912,0005,999,00017,010,688
8Apr 30, 2026 14:283,822592,358,455568,344,0004,994,00017,199,104
9Apr 30, 2026 14:283,834593,762,549568,137,0007,001,00017,129,472