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 10, 2026 09:52Victor MerckléVictor MerckléScore: 2,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 09:522,60215,197,8975,401,0001,105,0002,117,632stderr
2Sep 10, 2026 09:522,60715,321,9785,416,0001,102,0002,117,632stderr
3Sep 10, 2026 09:522,64015,309,7585,478,0001,124,0002,117,632stderr
4Sep 10, 2026 09:522,65415,328,9615,526,0001,111,0002,117,632stderr
5Sep 10, 2026 09:522,65515,456,0365,537,0001,102,0002,117,632stderr
6Sep 10, 2026 09:522,65815,396,1915,515,0001,131,0002,117,632stderr
7Sep 10, 2026 09:522,66815,363,9625,555,0001,117,0002,117,632stderr
8Sep 10, 2026 09:522,67415,405,7735,556,0001,129,0002,117,632stderr
9Sep 10, 2026 09:522,72215,494,0955,673,0001,134,0002,117,632stderr