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 listApr 28, 2026 04:03Charles CabergsCharles CabergsScore: 3,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 04:043,832590,594,292566,937,0007,999,00017,088,512
2Apr 28, 2026 04:043,833595,356,318565,998,0008,999,00017,100,800
3Apr 28, 2026 04:043,835594,597,209566,355,0009,005,00017,084,416
4Apr 28, 2026 04:043,836596,613,099565,552,0009,992,00016,990,208
5Apr 28, 2026 04:043,838592,754,953566,784,0008,996,00017,084,416
6Apr 28, 2026 04:043,838595,855,017564,819,00010,996,00017,170,432
7Apr 28, 2026 04:043,840591,364,884567,113,0009,001,00017,174,528
8Apr 28, 2026 04:043,840595,053,336567,046,0009,000,00017,088,512
9Apr 28, 2026 04:043,841593,986,680567,181,0009,002,00017,084,416