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:21TudyMTudyMScore: 5,492Success
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:235,448831,558,021792,350,00024,979,00017,145,856
2Apr 28, 2026 09:235,472840,028,604801,876,00018,997,00017,149,952
3Apr 28, 2026 09:235,481840,172,067792,324,00029,974,00017,141,760
4Apr 28, 2026 09:235,485841,116,359798,816,00023,994,00017,154,048
5Apr 28, 2026 09:235,492842,746,697793,853,00029,994,00017,141,760
6Apr 28, 2026 09:235,500843,421,091801,116,00023,973,00017,145,856
7Apr 28, 2026 09:235,502841,129,398799,396,00025,980,00016,982,016
8Apr 28, 2026 09:235,522845,355,314800,350,00027,977,00017,149,952
9Apr 28, 2026 09:235,528846,929,804805,300,00023,979,00017,076,224