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 7, 2026 03:43olliecrowolliecrowScore: 3,438Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 19:223,437541,835,420507,593,0007,993,00017,186,816
2Apr 17, 2026 19:273,437541,858,541512,512,0003,003,00017,186,816
3Apr 17, 2026 19:273,437536,247,188509,538,0005,994,00017,113,088
4Apr 17, 2026 19:223,438538,784,136508,677,0006,995,00017,117,184
5Apr 17, 2026 19:223,438536,430,170509,706,0005,996,00017,113,088
6Apr 17, 2026 19:273,438542,663,256511,714,0003,997,00017,117,184
7Apr 7, 2026 03:433,831600,826,938572,620,0001,998,00016,965,632
8Apr 7, 2026 03:433,832602,599,858572,762,0001,999,00017,141,760
9Apr 7, 2026 03:433,835597,720,450574,305,0001,000,00016,965,632