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 26, 2026 10:34Charles CabergsCharles CabergsScore: 3,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 10:353,834595,562,024565,136,00010,002,00017,080,320
2Apr 26, 2026 10:353,835592,409,770566,257,0009,004,00017,068,032
3Apr 26, 2026 10:353,835591,231,025567,294,0008,004,00017,076,224
4Apr 26, 2026 10:353,836594,636,737566,469,0008,991,00017,063,936
5Apr 26, 2026 10:353,837595,803,062566,681,0008,994,00016,990,208
6Apr 26, 2026 10:353,839595,954,375565,867,0009,997,00017,186,816
7Apr 26, 2026 10:353,839592,343,056565,939,0009,998,00017,080,320
8Apr 26, 2026 10:353,854594,910,291568,230,00010,004,00017,092,608
9Apr 26, 2026 10:353,856601,997,611567,436,00010,989,00017,068,032