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 11:57Dominique GarmierDominique GarmierScore: 16,237Success
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 11:5716,15663,221,00235,341,0005,048,0002,428,928
2Mar 19, 2026 11:5716,23763,515,08136,533,0004,059,0002,273,280
3Mar 19, 2026 11:5716,25968,157,75936,584,0004,064,0002,490,368