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 20:49olliecrowolliecrowScore: 3,621Success
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 20:493,618572,270,283521,679,00020,987,00017,043,456
2Mar 4, 2026 20:493,618571,534,268518,782,00023,989,00017,125,376
3Mar 4, 2026 20:493,620572,167,310521,942,00020,997,00017,051,648
4Mar 4, 2026 20:493,620569,537,037525,048,00018,001,00016,973,824
5Mar 4, 2026 20:493,621572,385,363523,096,00020,003,00017,092,608
6Mar 4, 2026 20:493,622578,585,206521,275,00022,011,00017,141,760
7Mar 4, 2026 20:493,623572,062,799522,428,00020,977,00017,174,528
8Mar 4, 2026 20:493,623574,737,547523,500,00019,980,00017,055,744
9Mar 4, 2026 20:493,627566,777,518526,038,00018,001,00017,059,840