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 22, 2026 16:43Dominique GarmierDominique GarmierScore: 139,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 16:43139,349376,165,938345,370,0003,003,0002,314,240
2Mar 22, 2026 16:43139,415377,259,220339,550,0008,988,0002,412,544
3Mar 22, 2026 16:43139,596377,091,672340,992,0007,999,0002,424,832