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 18:43Elijah KinElijah KinScore: 2,984Success
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 18:452,88516,282,8896,075,0001,138,0002,117,632
2Jun 3, 2026 18:452,88516,169,2076,084,0001,129,0002,117,632
3Jun 3, 2026 18:452,88616,168,4396,072,0001,144,0002,117,632
4Jun 3, 2026 18:452,88716,221,7116,068,0001,150,0002,117,632
5Jun 3, 2026 18:452,98416,317,6126,290,0001,170,0002,117,632
6Jun 3, 2026 18:453,04216,657,7696,453,0001,154,0002,117,632
7Jun 3, 2026 18:453,06416,671,2166,494,0001,168,0002,117,632
8Jun 3, 2026 18:453,06616,649,2276,516,0001,150,0002,117,632
9Jun 3, 2026 18:453,07218,333,6616,502,0001,179,0002,117,632