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:57olliecrowolliecrowScore: 5,383Success
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:575,26836,302,4779,119,0004,052,0002,486,272
2Apr 17, 2026 02:575,38333,879,6949,317,0004,141,0002,293,760
3Apr 17, 2026 02:575,51442,499,23412,724,0001,060,0002,396,160