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 listMar 4, 2026 22:48olliecrowolliecrowScore: 3,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 22:483,511550,359,415514,607,00011,990,00017,063,936
2Mar 4, 2026 22:483,511556,102,825517,622,0008,993,00017,006,592
3Mar 4, 2026 22:483,514553,666,140516,108,00011,002,00017,043,456
4Mar 4, 2026 22:483,516553,760,575513,352,00013,982,00017,055,744
5Mar 4, 2026 22:483,516552,661,253518,383,0008,989,00016,994,304
6Mar 4, 2026 22:483,517554,516,976515,517,00011,988,00017,063,936
7Mar 4, 2026 22:483,517555,433,037516,553,00010,990,00017,186,816
8Mar 4, 2026 22:483,518552,701,835516,768,00010,995,00017,063,936
9Mar 4, 2026 22:483,531562,000,544514,610,00014,988,00017,051,648