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 08:28TudyMTudyMScore: 5,759Success
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 08:315,312815,070,885759,829,00036,991,00017,133,568
2Apr 28, 2026 08:315,325816,886,657764,897,00033,995,00017,125,376
3Apr 28, 2026 08:315,342823,561,262767,434,00033,974,00017,149,952
4Apr 28, 2026 08:315,349820,833,674776,473,00025,982,00017,137,664
5Apr 28, 2026 08:315,759881,661,783831,938,00031,997,00017,002,496
6Apr 28, 2026 08:315,766883,120,910833,973,00030,961,00017,149,952
7Apr 28, 2026 08:315,783886,375,670831,567,00035,981,00017,141,760
8Apr 28, 2026 08:315,788886,375,648832,240,00035,967,00017,022,976
9Apr 28, 2026 08:315,791887,294,060836,709,00031,988,00017,149,952