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 14:21Victor MerckléVictor MerckléScore: 1,459Success
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 14:221,39412,310,3552,430,0001,055,0002,117,632stderr
2Sep 14, 2026 14:221,43212,399,1272,496,0001,085,0002,117,632stderr
3Sep 14, 2026 14:221,43712,336,2522,509,0001,085,0002,117,632stderr
4Sep 14, 2026 14:221,43912,419,2772,513,0001,086,0002,117,632stderr
5Sep 14, 2026 14:221,45912,175,5012,514,0001,134,0002,117,632stderr
6Sep 14, 2026 14:221,48812,536,8002,613,0001,108,0002,117,632stderr
7Sep 14, 2026 14:221,50512,487,7972,632,0001,132,0002,117,632stderr
8Sep 14, 2026 14:221,50712,465,7022,647,0001,121,0002,117,632stderr
9Sep 14, 2026 14:221,51712,393,2502,657,0001,136,0002,117,632stderr