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 listAug 14, 2026 17:11marko1597marko1597Score: 3,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:113,61817,292,2947,792,0001,254,0002,117,632
2Aug 14, 2026 17:113,65017,322,1687,833,0001,293,0002,117,632
3Aug 14, 2026 17:113,78317,850,3597,160,0002,298,0002,117,632