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 listOct 7, 2026 20:47Karthik ReddyKarthik ReddyScore: 1,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 20:471,68313,213,3652,974,0001,235,000520,192
2Oct 7, 2026 20:471,84913,534,9713,562,0001,062,000520,192
3Oct 7, 2026 20:471,91013,632,7453,686,0001,091,000520,192