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 28, 2026 10:46Dominique GarmierDominique GarmierScore: 9,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 10:469,38150,663,43422,433,0001,019,0002,428,928
2Mar 28, 2026 10:469,38551,495,31818,363,0005,100,0002,445,312
3Mar 28, 2026 10:469,39552,906,68119,403,0004,084,0002,371,584