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:17TudyMTudyMScore: 18,600Success
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:2018,4122,783,094,3362,734,843,00026,978,00017,223,680
2Apr 28, 2026 08:2018,4692,792,353,5142,746,521,00023,978,00017,182,720
3Apr 28, 2026 08:2018,4862,792,079,0792,741,967,00030,977,00017,182,720
4Apr 28, 2026 08:2018,5272,798,337,0892,756,129,00022,984,00017,154,048
5Apr 28, 2026 08:2018,6002,811,495,4052,755,125,00034,976,00017,149,952
6Apr 28, 2026 08:2018,6142,811,518,0842,762,151,00029,979,00017,195,008
7Apr 28, 2026 08:2018,6822,820,610,4312,774,332,00027,973,00017,014,784
8Apr 28, 2026 08:2018,7062,826,204,0522,779,999,00025,981,00016,973,824
9Apr 28, 2026 08:2021,6073,260,133,9813,207,215,00033,981,00017,022,976