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 09:02TudyMTudyMScore: 5,481Success
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 09:035,456838,387,779788,476,00029,980,00017,149,952
2Apr 28, 2026 09:035,463838,084,418792,521,00026,983,00017,145,856
3Apr 28, 2026 09:035,478839,839,620787,720,00033,987,00017,076,224
4Apr 28, 2026 09:035,479838,893,732790,900,00030,996,00017,141,760
5Apr 28, 2026 09:035,481841,814,955784,268,00037,964,00017,133,568
6Apr 28, 2026 09:035,512849,899,862792,896,00033,995,00017,145,856
7Apr 28, 2026 09:035,521846,062,682796,215,00031,968,00017,137,664
8Apr 28, 2026 09:035,618864,845,854816,729,00025,991,00017,100,800
9Apr 28, 2026 09:035,619857,911,004814,896,00027,996,00017,149,952