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 listJan 8, 2026 19:169999199991Score: 5,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 19:165,205809,152,373755,740,00024,991,00017,080,320
2Jan 8, 2026 19:165,213814,768,519758,947,00022,998,00017,186,816
3Jan 8, 2026 19:165,223806,271,153759,432,00023,982,00016,998,400
4Jan 8, 2026 19:165,237818,749,018759,577,00025,985,00017,080,320
5Jan 8, 2026 19:165,243821,806,469761,522,00024,984,00016,969,728
6Jan 8, 2026 19:165,523855,864,071803,522,00024,985,00017,047,552
7Jan 8, 2026 19:165,555866,421,195810,283,00022,979,00017,080,320
8Jan 8, 2026 19:165,675883,094,848826,252,00025,007,00017,080,320
9Jan 8, 2026 19:165,839897,762,410848,896,00026,996,00017,084,416