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 listFeb 17, 2026 00:11Valentin KofmanValentin KofmanScore: 3,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 00:113,792598,019,334567,844,000999,00016,957,440
2Feb 17, 2026 00:113,792593,201,776566,855,0001,999,00017,076,224
3Feb 17, 2026 00:113,792592,100,728566,864,0001,999,00017,195,008
4Feb 17, 2026 00:113,793598,449,060565,963,0002,999,00017,076,224
5Feb 17, 2026 00:113,793592,999,941567,978,000999,00016,957,440
6Feb 17, 2026 00:113,794603,585,530567,062,0002,000,00017,080,320
7Feb 17, 2026 00:113,794594,137,868567,071,0002,000,00017,072,128
8Feb 17, 2026 00:113,794597,528,917568,099,0001,000,00016,957,440
9Feb 17, 2026 00:113,796594,332,975567,345,0001,997,00016,957,440