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 listApr 17, 2026 01:33olliecrowolliecrowScore: 5,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 01:334,97234,452,10412,430,00002,408,448
2Apr 17, 2026 01:335,16229,992,6479,927,0002,978,0002,334,720
3Apr 17, 2026 01:335,22834,298,48610,053,0003,016,0002,338,816