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 listJun 3, 2026 23:38Elijah KinElijah KinScore: 2,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 23:412,84516,236,5275,991,0001,123,0002,117,632
2Jun 3, 2026 23:412,84616,101,7625,988,0001,127,0002,117,632
3Jun 3, 2026 23:412,89916,254,7366,085,0001,163,0002,117,632
4Jun 3, 2026 23:412,90716,297,0936,093,0001,175,0002,117,632
5Jun 3, 2026 23:412,91016,749,6386,130,0001,146,0002,117,632
6Jun 3, 2026 23:412,92316,789,2426,157,0001,152,0002,117,632
7Jun 3, 2026 23:412,92616,774,1076,147,0001,170,0002,117,632
8Jun 3, 2026 23:412,93416,868,3916,175,0001,162,0002,117,632
9Jun 3, 2026 23:413,00617,036,7826,391,0001,125,0002,117,632