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 05:54Victor MerckléVictor MerckléScore: 1,485Success
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 05:551,41412,007,6791,871,0001,664,0002,117,632stderr
2Sep 15, 2026 05:551,46113,080,5582,484,0001,169,0002,117,632stderr
3Sep 15, 2026 05:551,46412,464,4222,071,0001,589,0002,117,632stderr
4Sep 15, 2026 05:551,47012,389,4192,070,0001,607,0002,117,632stderr
5Sep 15, 2026 05:551,48512,268,0252,508,0001,206,0002,117,632stderr
6Sep 15, 2026 05:551,49012,420,5032,127,0001,600,0002,117,632stderr
7Sep 15, 2026 05:551,50012,438,3932,066,0001,684,0002,117,632stderr
8Sep 15, 2026 05:551,51012,518,6882,569,0001,208,0002,117,632stderr
9Sep 15, 2026 05:551,52812,503,3462,115,0001,706,0002,117,632stderr