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 listSep 14, 2026 00:29Andrew EpsteinAndrew EpsteinScore: 1,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:301,33212,085,7813,331,00002,117,632
2Sep 14, 2026 00:301,33412,062,5663,336,00002,117,632
3Sep 14, 2026 00:301,33612,037,7783,341,00002,117,632
4Sep 14, 2026 00:301,34012,119,1633,350,00002,117,632
5Sep 14, 2026 00:301,34212,070,5973,355,00002,117,632
6Sep 14, 2026 00:301,34311,854,2333,358,00002,117,632
7Sep 14, 2026 00:301,42612,296,5313,567,00002,117,632
8Sep 14, 2026 00:301,42612,255,2513,567,00002,117,632
9Sep 14, 2026 00:301,48012,393,3932,695,0001,007,0002,117,632