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 20, 2026 14:26Victor MerckléVictor MerckléScore: 2,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:272,71214,789,7835,433,0001,347,0002,113,536
2May 20, 2026 14:272,72015,684,5025,451,0001,350,0002,113,536
3May 20, 2026 14:272,72217,027,5395,458,0001,348,0002,113,536
4May 20, 2026 14:272,72615,165,1015,461,0001,356,0002,113,536
5May 20, 2026 14:272,72714,585,9225,470,0001,349,0002,113,536
6May 20, 2026 14:272,82914,629,6025,733,0001,341,0002,113,536
7May 20, 2026 14:272,84214,866,4485,764,0001,341,0002,113,536
8May 20, 2026 14:272,85615,627,4595,782,0001,359,0002,113,536
9May 20, 2026 14:272,85915,736,1914,832,0002,317,0002,113,536