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 15, 2026 00:28Victor MerckléVictor MerckléScore: 1,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 00:291,37212,116,8751,887,0001,545,0002,117,632stderr
2Sep 15, 2026 00:291,40812,282,8421,943,0001,577,0002,117,632stderr
3Sep 15, 2026 00:291,45213,082,7252,100,0001,532,0002,117,632stderr
4Sep 15, 2026 00:291,45317,133,4552,084,0001,549,0002,117,632stderr
5Sep 15, 2026 00:291,46512,475,3412,522,0001,142,0002,117,632stderr
6Sep 15, 2026 00:291,48212,399,6312,140,0001,566,0002,117,632stderr
7Sep 15, 2026 00:291,48512,449,5612,131,0001,582,0002,117,632stderr
8Sep 15, 2026 00:291,48613,167,4822,147,0001,570,0002,117,632stderr
9Sep 15, 2026 00:291,48913,946,2582,140,0001,583,0002,117,632stderr