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 listMar 15, 2026 06:00Elijah KinElijah KinScore: 12,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 06:0012,86655,390,97327,139,0005,025,0002,342,912
2Mar 15, 2026 06:0012,88660,400,17727,182,0005,033,0002,396,160
3Mar 15, 2026 06:0012,88855,247,65930,206,0002,013,0002,306,048