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:22Andrew EpsteinAndrew EpsteinScore: 2,819Success
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:222,71216,646,7365,566,0001,216,0002,117,632
2Aug 23, 2026 03:222,75817,974,0425,652,0001,243,0002,117,632
3Aug 23, 2026 03:222,75816,730,6825,675,0001,221,0002,117,632
4Aug 23, 2026 03:222,76316,804,6005,681,0001,227,0002,117,632
5Aug 23, 2026 03:222,81916,961,1555,816,0001,232,0002,117,632
6Aug 23, 2026 03:222,82216,932,9305,816,0001,241,0002,117,632
7Aug 23, 2026 03:222,82917,008,7325,836,0001,237,0002,117,632
8Aug 23, 2026 03:222,83717,002,2035,849,0001,244,0002,117,632
9Aug 23, 2026 03:222,84017,006,9815,865,0001,236,0002,117,632