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 15, 2026 09:48Victor MerckléVictor MerckléScore: 1,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 09:491,34812,157,1181,857,0001,513,0002,117,632stderr
2Sep 15, 2026 09:491,37711,961,5471,891,0001,553,0002,117,632stderr
3Sep 15, 2026 09:491,38212,318,1612,358,0001,098,0002,117,632stderr
4Sep 15, 2026 09:491,40312,164,6411,950,0001,559,0002,117,632stderr
5Sep 15, 2026 09:491,46012,284,7702,518,0001,134,0002,117,632stderr
6Sep 15, 2026 09:491,47013,167,5042,540,0001,136,0002,117,632stderr
7Sep 15, 2026 09:491,47112,219,8762,522,0001,157,0002,117,632stderr
8Sep 15, 2026 09:491,54212,437,9222,708,0001,147,0002,117,632stderr
9Sep 15, 2026 09:491,57812,538,9582,795,0001,152,0002,117,632stderr