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 listMar 19, 2026 09:49Dominique GarmierDominique GarmierScore: 11,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 09:4911,24356,262,26725,097,0003,011,0002,457,600
2Mar 19, 2026 09:4911,30055,638,49625,223,0003,026,0002,424,832
3Mar 19, 2026 09:4911,32460,393,05223,255,0005,055,0002,285,568