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:19olliecrowolliecrowScore: 3,432Success
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:193,431541,663,694508,674,0005,996,00016,998,400
2Mar 10, 2026 05:193,431541,779,694509,689,0004,996,00017,170,432
3Mar 10, 2026 05:193,432543,071,418508,760,0005,997,00017,137,664
4Mar 10, 2026 05:193,432538,362,430508,848,0005,998,00016,998,400
5Mar 10, 2026 05:193,432545,926,542508,863,0005,998,00017,010,688
6Mar 10, 2026 05:193,433539,987,024509,884,0004,998,00017,186,816
7Mar 10, 2026 05:193,433541,886,382510,933,0003,999,00017,092,608
8Mar 10, 2026 05:193,434541,330,914508,116,0007,001,00016,994,304
9Mar 10, 2026 05:193,467547,416,466514,014,0006,000,00017,022,976