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:37M-RochatM-RochatScore: 4,414Success
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:374,39819,676,1629,926,0001,071,0002,117,632
2May 17, 2026 11:374,40419,706,1859,939,0001,072,0002,117,632
3May 17, 2026 11:374,40619,761,7939,943,0001,072,0002,113,536
4May 17, 2026 11:374,41319,662,2009,962,0001,072,0002,121,728
5May 17, 2026 11:374,41419,918,6989,963,0001,072,0002,117,632
6May 17, 2026 11:374,41819,723,3259,972,0001,074,0002,113,536
7May 17, 2026 11:374,42019,842,9829,977,0001,073,0002,113,536
8May 17, 2026 11:374,42619,857,8959,992,0001,074,0002,121,728
9May 17, 2026 11:374,42819,727,2909,998,0001,073,0002,113,536