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 listSep 14, 2026 21:32Victor MerckléVictor MerckléScore: 1,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 21:471,37212,214,2431,851,0001,581,0002,117,632stderr
2Sep 14, 2026 21:471,37212,029,3481,848,0001,582,0002,117,632stderr
3Sep 14, 2026 21:471,39512,327,2041,877,0001,611,0002,117,632stderr
4Sep 14, 2026 21:471,43612,360,3982,044,0001,548,0002,117,632stderr
5Sep 14, 2026 21:471,43713,727,7202,038,0001,556,0002,117,632stderr
6Sep 14, 2026 21:471,45612,376,0841,986,0001,654,0002,117,632stderr
7Sep 14, 2026 21:471,47512,282,3092,525,0001,164,0002,117,632stderr
8Sep 14, 2026 21:471,50412,618,8482,116,0001,644,0002,117,632stderr
9Sep 14, 2026 21:471,50813,120,1532,141,0001,630,0002,117,632stderr