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:16TudyMTudyMScore: 9,341Success
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:169,2601,408,552,3661,358,113,00030,979,00017,145,856
2Apr 28, 2026 09:169,2611,409,732,2441,363,308,00025,986,00017,145,856
3Apr 28, 2026 09:169,2761,411,065,6711,360,481,00030,988,00017,096,704
4Apr 28, 2026 09:169,3251,419,557,1921,363,875,00034,996,00017,149,952
5Apr 28, 2026 09:169,3411,419,991,7051,366,268,00034,981,00016,986,112
6Apr 28, 2026 09:169,3481,421,661,9361,375,316,00026,986,00017,235,968
7Apr 28, 2026 09:169,4341,434,050,9951,381,202,00033,980,00017,154,048
8Apr 28, 2026 09:169,4911,442,205,3041,387,667,00035,991,00017,137,664
9Apr 28, 2026 09:169,5431,452,147,6651,392,476,00038,985,00017,018,880