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 12:11Jacob McDanielJacob McDanielScore: 2,757Success
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 12:122,72417,203,4125,631,0001,181,0002,117,632
2May 20, 2026 12:122,75018,160,8315,661,0001,215,0002,117,632
3May 20, 2026 12:122,75316,197,1045,692,0001,191,0002,117,632
4May 20, 2026 12:122,75417,821,2345,674,0001,213,0002,117,632
5May 20, 2026 12:122,75716,308,8025,687,0001,207,0002,117,632
6May 20, 2026 12:122,79318,523,5325,739,0001,245,0002,117,632
7May 20, 2026 12:122,81816,893,2315,769,0001,278,0002,117,632
8May 20, 2026 12:122,85219,335,5765,866,0001,266,0002,117,632
9May 20, 2026 12:122,85527,425,9625,940,0001,199,0002,117,632