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:49olliecrowolliecrowScore: 4,902Success
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:494,64628,096,73911,615,00002,486,272
2Apr 17, 2026 02:494,90232,334,84210,214,0002,042,0002,404,352
3Apr 17, 2026 02:494,93129,210,25110,274,0002,054,0002,482,176