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 02:15olliecrowolliecrowScore: 4,682Success
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 02:154,62728,365,70210,517,0001,051,0002,306,048
2Apr 17, 2026 02:154,68237,604,62611,706,00002,461,696
3Apr 17, 2026 02:154,76328,884,0669,923,0001,984,0002,441,216