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 29, 2026 20:02Charles CabergsCharles CabergsScore: 3,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 20:023,818595,099,989565,807,0006,997,00017,121,280
2Apr 29, 2026 20:023,820594,686,896564,144,0009,002,00017,043,456
3Apr 29, 2026 20:023,822594,441,782565,433,0008,006,00017,121,280
4Apr 29, 2026 20:023,822591,364,224565,409,0007,991,00016,977,920
5Apr 29, 2026 20:023,822588,449,317564,389,0009,006,00017,235,968
6Apr 29, 2026 20:023,823590,735,679566,489,0006,993,00017,121,280
7Apr 29, 2026 20:023,823588,676,045566,448,0007,005,00017,129,472
8Apr 29, 2026 20:023,824590,906,057564,728,0008,995,00017,010,688
9Apr 29, 2026 20:023,824592,279,324566,633,0006,995,00017,121,280