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 listNov 2, 2026 21:20Andrew EpsteinAndrew EpsteinScore: 12,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2026 21:2012,72440,988,47330,710,0001,101,0002,117,632stderr
2Nov 2, 2026 21:2012,72441,002,92930,698,0001,112,0002,117,632stderr
3Nov 2, 2026 21:2012,72641,420,42130,695,0001,122,0002,117,632stderr
4Nov 2, 2026 21:2012,72741,443,41830,699,0001,119,0002,117,632stderr
5Nov 2, 2026 21:2012,73541,061,64130,716,0001,123,0002,117,632stderr
6Nov 2, 2026 21:2012,75441,541,20130,757,0001,130,0002,117,632stderr
7Nov 2, 2026 21:2012,75641,621,75930,699,0001,193,0002,117,632stderr
8Nov 2, 2026 21:2012,77841,388,52730,766,0001,179,0002,117,632stderr
9Nov 2, 2026 21:2012,83741,715,18730,901,0001,193,0002,117,632stderr