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 18, 2026 19:12Jacob McDanielJacob McDanielScore: 2,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 19:122,75318,283,4565,670,0001,214,0002,117,632
2May 18, 2026 19:122,76617,170,2305,726,0001,190,0002,117,632
3May 18, 2026 19:122,77517,250,3055,745,0001,193,0002,113,536
4May 18, 2026 19:122,77616,143,6095,736,0001,204,0002,117,632
5May 18, 2026 19:122,78219,025,1735,750,0001,205,0002,117,632
6May 18, 2026 19:122,79118,139,8075,777,0001,201,0002,117,632
7May 18, 2026 19:122,81216,465,0355,781,0001,251,0002,117,632
8May 18, 2026 19:122,81716,439,9935,814,0001,229,0002,117,632
9May 18, 2026 19:122,84617,395,8555,850,0001,265,0002,117,632