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 13:31Jacob McDanielJacob McDanielScore: 2,650Success
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 13:312,50717,508,1115,067,0001,202,0002,117,632
2May 20, 2026 13:312,52615,661,6585,127,0001,189,0002,117,632
3May 20, 2026 13:312,52716,117,9315,179,0001,140,0002,117,632
4May 20, 2026 13:312,53615,592,6145,129,0001,213,0002,117,632
5May 20, 2026 13:312,65016,527,8825,355,0001,270,0002,117,632
6May 20, 2026 13:312,65916,829,3925,384,0001,265,0002,117,632
7May 20, 2026 13:312,67318,916,2065,401,0001,283,0002,117,632
8May 20, 2026 13:312,67816,400,9685,407,0001,288,0002,117,632
9May 20, 2026 13:312,70617,432,8365,486,0001,281,0002,117,632