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 16, 2026 04:22olliecrowolliecrowScore: 6,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 04:226,28242,593,85814,658,0001,047,0002,314,240
2Apr 16, 2026 04:226,29234,671,77613,633,0002,097,0002,326,528
3Apr 16, 2026 04:226,52233,788,37414,268,0002,038,0002,318,336