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 23, 2026 03:30Andrew EpsteinAndrew EpsteinScore: 2,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 03:302,89617,113,8906,034,0001,207,0002,117,632
2Aug 23, 2026 03:302,90617,196,8766,053,0001,213,0002,117,632
3Aug 23, 2026 03:302,94717,979,2116,134,0001,234,0002,117,632
4Aug 23, 2026 03:302,94917,218,5166,148,0001,226,0002,117,632
5Aug 23, 2026 03:302,95817,253,0776,172,0001,224,0002,117,632
6Aug 23, 2026 03:302,96017,961,0186,154,0001,246,0002,117,632
7Aug 23, 2026 03:302,96717,373,8866,185,0001,234,0002,117,632
8Aug 23, 2026 03:302,97617,304,9316,208,0001,233,0002,117,632
9Aug 23, 2026 03:302,97618,038,5526,199,0001,242,0002,117,632