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 listAug 30, 2026 19:22Victor MerckléVictor MerckléScore: 1,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:231,608252,395,085233,139,0008,146,00016,826,368stderr
2Aug 30, 2026 19:231,609252,684,071232,303,0009,096,00016,842,752stderr
3Aug 30, 2026 19:231,609251,792,993233,298,0008,142,00016,822,272stderr
4Aug 30, 2026 19:231,610252,974,962233,365,0008,248,00016,826,368stderr
5Aug 30, 2026 19:231,610249,863,885233,361,0008,175,00016,822,272stderr
6Aug 30, 2026 19:231,612251,953,169233,765,0008,157,00016,957,440stderr
7Aug 30, 2026 19:231,612252,956,913232,707,0009,188,00016,957,440stderr
8Aug 30, 2026 19:231,613252,624,965233,756,0008,205,00016,822,272stderr
9Aug 30, 2026 19:231,613252,747,714232,764,0009,189,00016,961,536stderr