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 16:36Victor MerckléVictor MerckléScore: 1,544Success
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 16:451,43512,288,6892,520,0001,069,0002,117,632stderr
2Sep 10, 2026 16:451,48712,193,8392,601,0001,118,0002,117,632stderr
3Sep 10, 2026 16:451,49812,409,2832,646,0001,101,0002,117,632stderr
4Sep 10, 2026 16:451,53412,483,1832,702,0001,134,0002,117,632stderr
5Sep 10, 2026 16:451,54412,541,9572,733,0001,129,0002,117,632stderr
6Sep 10, 2026 16:451,54612,322,2212,683,0001,184,0002,117,632stderr
7Sep 10, 2026 16:451,55112,382,3052,736,0001,142,0002,117,632stderr
8Sep 10, 2026 16:451,55112,422,6072,732,0001,146,0002,117,632stderr
9Sep 10, 2026 16:451,61913,310,9152,897,0001,151,0002,117,632stderr