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 10, 2026 05:03olliecrowolliecrowScore: 3,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 05:033,430541,115,473508,526,0005,994,00017,129,472
2Mar 10, 2026 05:033,431545,084,667507,727,0006,996,00017,084,416
3Mar 10, 2026 05:033,432541,025,621507,739,0006,996,00017,055,744
4Mar 10, 2026 05:033,432542,531,554507,861,0006,998,00016,973,824
5Mar 10, 2026 05:033,433544,129,263506,922,0007,998,00017,141,760
6Mar 10, 2026 05:033,433538,886,844508,949,0005,999,00017,108,992
7Mar 10, 2026 05:033,433536,294,906509,017,0006,000,00017,158,144
8Mar 10, 2026 05:033,435545,654,276507,191,0008,003,00016,969,728
9Mar 10, 2026 05:033,436543,146,361507,399,0007,990,00017,141,760