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 4, 2026 16:06Victor MerckléVictor MerckléScore: 1,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 16:111,45612,097,5272,559,0001,082,0002,117,632stderr
2Sep 4, 2026 16:111,45711,847,3872,550,0001,094,0002,117,632stderr
3Sep 4, 2026 16:111,45811,888,0912,554,0001,092,0002,117,632stderr
4Sep 4, 2026 16:111,46012,078,9952,560,0001,092,0002,117,632stderr
5Sep 4, 2026 16:111,51012,102,9402,668,0001,108,0002,117,632stderr
6Sep 4, 2026 16:111,53112,396,0022,605,0001,223,0002,117,632stderr
7Sep 4, 2026 16:111,53320,965,0842,644,0001,190,0002,117,632stderr
8Sep 4, 2026 16:111,56112,298,3482,765,0001,139,0002,117,632stderr
9Sep 4, 2026 16:111,57012,245,6302,781,0001,144,0002,117,632stderr