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 21, 2026 03:56Dominique GarmierDominique GarmierScore: 11,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 03:5611,19056,671,36922,980,0004,995,0002,285,568
2Mar 21, 2026 03:5611,22451,256,75423,050,0005,010,0002,277,376
3Mar 21, 2026 03:5611,39750,947,43023,404,0005,088,0002,334,720