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 listMay 29, 2026 10:21Victor MerckléVictor MerckléScore: 2,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 10:222,61614,150,8765,199,0001,343,0002,113,536
2May 29, 2026 10:222,61816,471,4995,202,0001,344,0002,113,536
3May 29, 2026 10:222,62814,499,6885,224,0001,348,0002,113,536
4May 29, 2026 10:222,64914,504,2715,269,0001,354,0002,113,536
5May 29, 2026 10:222,65414,325,5935,279,0001,357,0002,113,536
6May 29, 2026 10:222,65614,833,9245,276,0001,364,0002,113,536
7May 29, 2026 10:222,68315,018,8665,335,0001,374,0002,113,536
8May 29, 2026 10:222,69814,898,3545,397,0001,350,0002,113,536
9May 29, 2026 10:222,74314,567,9995,510,0001,349,0002,113,536