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 listAug 27, 2026 17:36Elijah KinElijah KinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:36017,099,8535,260,0001,517,0002,117,632pos 250000: expected 3 got 148
2Aug 27, 2026 17:36016,878,8555,499,0001,522,0002,117,632pos 250000: expected 144 got 84
3Aug 27, 2026 17:36017,034,8625,270,0001,508,0002,117,632pos 250000: expected 247 got 219