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 11:33M-RochatM-RochatScore: 4,420Success
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 11:334,41519,751,9129,966,0001,073,0002,121,728
2May 17, 2026 11:334,41819,497,5879,970,0001,076,0002,117,632
3May 17, 2026 11:334,41819,816,1659,973,0001,074,0002,117,632
4May 17, 2026 11:334,41919,586,0079,975,0001,073,0002,117,632
5May 17, 2026 11:334,42019,786,1419,976,0001,075,0002,113,536
6May 17, 2026 11:334,42219,694,7229,984,0001,073,0002,117,632
7May 17, 2026 11:334,42420,395,2269,989,0001,072,0002,117,632
8May 17, 2026 11:334,42619,882,7759,991,0001,074,0002,117,632
9May 17, 2026 11:334,47319,718,77410,097,0001,087,0002,121,728