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 08:12Jacob McDanielJacob McDanielScore: 2,873Success
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 08:132,75716,309,7725,688,0001,205,0002,121,728
2May 20, 2026 08:132,77019,130,9585,727,0001,200,0002,117,632
3May 20, 2026 08:132,78818,715,1175,756,0001,216,0002,121,728
4May 20, 2026 08:132,85819,439,7295,881,0001,264,0002,121,728
5May 20, 2026 08:132,87319,450,1535,909,0001,274,0002,117,632
6May 20, 2026 08:132,88617,597,5355,957,0001,260,0002,121,728
7May 20, 2026 08:132,90618,346,7775,994,0001,272,0002,121,728
8May 20, 2026 08:132,91016,832,4336,001,0001,276,0002,121,728
9May 20, 2026 08:132,99930,717,9325,429,0002,070,0002,117,632