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 09:03Victor MerckléVictor MerckléScore: 1,539Success
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 09:031,44212,350,6772,530,0001,076,0002,117,632stderr
2Sep 14, 2026 09:031,45412,382,3962,541,0001,096,0002,117,632stderr
3Sep 14, 2026 09:031,52812,365,7052,654,0001,167,0002,117,632stderr
4Sep 14, 2026 09:031,53413,238,9212,713,0001,122,0002,117,632stderr
5Sep 14, 2026 09:031,53912,431,6702,693,0001,156,0002,117,632stderr
6Sep 14, 2026 09:031,54012,555,0062,726,0001,126,0002,117,632stderr
7Sep 14, 2026 09:031,54312,480,5032,717,0001,141,0002,117,632stderr
8Sep 14, 2026 09:031,55213,285,6552,739,0001,142,0002,117,632stderr
9Sep 14, 2026 09:031,57812,599,4182,814,0001,131,0002,117,632stderr