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:03Victor MerckléVictor MerckléScore: 1,494Success
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:041,42812,275,1982,111,0001,461,0002,117,632stderr
2Sep 14, 2026 14:041,43012,353,3142,124,0001,451,0002,117,632stderr
3Sep 14, 2026 14:041,47012,402,8442,198,0001,478,0002,117,632stderr
4Sep 14, 2026 14:041,49412,378,8502,567,0001,169,0002,117,632stderr
5Sep 14, 2026 14:041,49412,453,5052,233,0001,503,0002,117,632stderr
6Sep 14, 2026 14:041,50912,470,7002,270,0001,503,0002,117,632stderr
7Sep 14, 2026 14:041,51712,337,0802,284,0001,509,0002,117,632stderr
8Sep 14, 2026 14:041,51913,182,7912,299,0001,499,0002,117,632stderr
9Sep 14, 2026 14:041,52712,506,1422,632,0001,187,0002,117,632stderr