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 7, 2026 00:48Elijah KinElijah KinScore: 2,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 00:492,25514,714,0924,525,0001,113,0002,117,632
2Jun 7, 2026 00:492,26514,780,4534,544,0001,120,0002,117,632
3Jun 7, 2026 00:492,26714,654,7874,549,0001,120,0002,117,632
4Jun 7, 2026 00:492,27014,671,9454,561,0001,115,0002,117,632
5Jun 7, 2026 00:492,27514,769,1734,572,0001,117,0002,117,632
6Jun 7, 2026 00:492,31514,813,2524,676,0001,113,0002,117,632
7Jun 7, 2026 00:492,39415,011,0544,878,0001,108,0002,117,632
8Jun 7, 2026 00:492,41315,047,2434,881,0001,153,0002,117,632
9Jun 7, 2026 00:492,43415,068,9574,970,0001,116,0002,117,632