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 listNov 14, 2025 17:34izotoffizotoffScore: 34,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 17:3434,741116,918,83283,859,0002,994,0002,482,176
2Nov 14, 2025 17:3434,778117,778,58184,948,0001,998,0002,387,968
3Nov 14, 2025 17:3434,916110,224,66383,278,0004,013,0002,392,064