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:18TudyMTudyMScore: 24,792Success
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:1924,6103,715,823,6973,659,560,00031,987,00017,084,416
2Apr 28, 2026 09:1924,6253,709,088,9763,666,877,00026,984,00017,055,744
3Apr 28, 2026 09:1924,7623,731,269,0513,690,338,00023,989,00017,149,952
4Apr 28, 2026 09:1924,7873,737,241,6623,690,106,00027,985,00016,998,400
5Apr 28, 2026 09:1924,7923,739,199,7903,692,945,00025,985,00017,199,104
6Apr 28, 2026 09:1924,7953,736,399,9453,690,341,00028,986,00017,125,376
7Apr 28, 2026 09:1924,8723,752,707,8603,702,958,00027,984,00017,158,144
8Apr 28, 2026 09:1924,9473,758,040,6303,717,122,00024,987,00016,973,824
9Apr 28, 2026 09:1925,4603,839,450,5583,793,072,00025,986,00017,039,360