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 06:44Jacob McDanielJacob McDanielScore: 2,833Success
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 06:542,74718,259,6585,688,0001,181,0002,117,632
2May 18, 2026 06:542,82116,241,0925,799,0001,255,0002,117,632
3May 18, 2026 06:542,82416,933,5645,793,0001,267,0002,117,632
4May 18, 2026 06:542,82818,390,0985,794,0001,278,0002,117,632
5May 18, 2026 06:542,83316,977,0735,826,0001,258,0002,117,632
6May 18, 2026 06:542,83817,672,8315,826,0001,269,0002,117,632
7May 18, 2026 06:542,83818,124,3055,826,0001,270,0002,117,632
8May 18, 2026 06:542,88418,304,1935,953,0001,257,0002,117,632
9May 18, 2026 06:542,89617,100,5135,979,0001,262,0002,117,632