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 listApr 24, 2026 02:00olliecrowolliecrowScore: 3,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 02:013,410533,189,231506,628,0004,996,00017,084,416
2Apr 24, 2026 02:013,410530,187,482506,640,0004,996,00017,088,512
3Apr 24, 2026 02:013,412532,669,398507,844,0003,998,00017,080,320
4Apr 24, 2026 02:013,412527,743,622505,912,0005,998,00017,096,704
5Apr 24, 2026 02:013,413529,349,483507,982,0003,999,00017,149,952
6Apr 24, 2026 02:013,413529,722,771508,061,0003,992,00017,088,512
7Apr 24, 2026 02:013,414531,479,619509,108,0003,000,00017,092,608
8Apr 24, 2026 02:013,415528,966,865509,365,0003,002,00017,182,720
9Apr 24, 2026 02:013,416533,124,162507,481,0004,994,00017,092,608