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 21:02olliecrowolliecrowScore: 3,615Success
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 21:023,613566,371,211520,967,00020,998,00017,174,528
2Mar 4, 2026 21:023,614573,317,310522,109,00020,004,00017,125,376
3Mar 4, 2026 21:023,615569,598,391525,177,00017,005,00017,084,416
4Mar 4, 2026 21:023,615569,508,916519,222,00023,009,00016,977,920
5Mar 4, 2026 21:023,615568,814,526519,250,00023,011,00017,039,360
6Mar 4, 2026 21:023,616571,214,534523,429,00018,979,00017,039,360
7Mar 4, 2026 21:023,616574,064,874519,486,00022,977,00016,957,440
8Mar 4, 2026 21:023,617567,233,418521,559,00020,982,00017,178,624
9Mar 4, 2026 21:023,622567,244,437525,325,00017,976,00017,055,744