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 23, 2026 03:25olliecrowolliecrowScore: 4,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 03:274,717724,268,157703,679,0003,998,00017,014,784
2Apr 23, 2026 03:274,771735,795,755713,716,0001,999,00017,272,832
3Apr 23, 2026 03:274,791737,119,008715,748,0002,998,00017,022,976
4Apr 23, 2026 03:274,791741,665,126716,742,0001,999,00017,248,256
5Apr 23, 2026 03:274,797744,498,738716,681,0002,998,00017,100,800
6Apr 23, 2026 03:274,797739,296,748717,679,0002,001,00017,141,760
7Apr 23, 2026 03:274,797741,271,762717,617,0001,998,00017,240,064
8Apr 23, 2026 03:274,799740,296,733716,930,0002,999,00017,125,376
9Apr 23, 2026 03:274,799737,345,997716,928,0002,999,00017,113,088