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 23, 2026 01:04Dominique GarmierDominique GarmierScore: 4,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 01:044,215663,041,254608,323,00023,973,00017,174,528
2Mar 23, 2026 01:044,218655,452,646604,760,00027,988,00017,043,456
3Mar 23, 2026 01:044,228670,570,287609,152,00025,006,00016,969,728
4Mar 23, 2026 01:044,230661,844,441605,594,00028,980,00017,076,224
5Mar 23, 2026 01:044,238659,907,033608,698,00026,986,00016,973,824
6Mar 23, 2026 01:044,245663,126,330614,732,00021,990,00016,953,344
7Mar 23, 2026 01:044,263666,627,951610,416,00028,972,00017,035,264
8Mar 23, 2026 01:044,296667,680,770620,386,00023,976,00017,018,880
9Mar 23, 2026 01:044,315673,861,662623,254,00023,971,00017,182,720