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 19:19olliecrowolliecrowScore: 3,890Success
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 19:193,883610,163,406570,520,00011,989,00017,174,528
2Mar 4, 2026 19:193,885608,956,733566,743,00015,992,00017,186,816
3Mar 4, 2026 19:193,887613,243,100570,005,00013,000,00017,170,432
4Mar 4, 2026 19:193,887608,022,926570,084,00013,001,00017,174,528
5Mar 4, 2026 19:193,890610,976,809572,496,00010,990,00017,190,912
6Mar 4, 2026 19:193,890619,845,249576,567,0006,994,00017,117,184
7Mar 4, 2026 19:193,891610,737,807569,672,00013,991,00017,108,992
8Mar 4, 2026 19:193,893610,317,214575,947,0007,999,00017,170,432
9Mar 4, 2026 19:193,897610,294,833572,531,00011,990,00016,953,344