Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listMay 17, 2026 10:14M-RochatM-RochatScore: 4,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 10:144,29219,292,7539,669,0001,063,0002,121,728
2May 17, 2026 10:144,29519,499,2359,674,0001,064,0002,117,632
3May 17, 2026 10:144,30219,398,9969,690,0001,066,0002,117,632
4May 17, 2026 10:144,41525,515,7029,965,0001,073,0002,117,632
5May 17, 2026 10:144,41620,933,4719,970,0001,072,0002,113,536
6May 17, 2026 10:144,42220,490,9099,980,0001,075,0002,117,632
7May 17, 2026 10:144,42219,789,7509,983,0001,074,0002,117,632
8May 17, 2026 10:144,42519,613,3409,988,0001,075,0002,117,632
9May 17, 2026 10:144,43919,842,33010,026,0001,073,0002,121,728