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 listApr 17, 2026 01:51olliecrowolliecrowScore: 4,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 01:514,79129,680,6818,984,0002,994,0002,457,600
2Apr 17, 2026 01:514,80339,038,32010,006,0002,001,0002,355,200
3Apr 17, 2026 01:514,82833,267,2788,046,0004,023,0002,461,696