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 13, 2026 23:29Andrew EpsteinAndrew EpsteinScore: 1,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 23:331,52212,360,5822,744,0001,063,0002,117,632
2Sep 13, 2026 23:331,53012,453,2352,760,0001,066,0002,117,632
3Sep 13, 2026 23:331,53412,341,3972,755,0001,082,0002,117,632
4Sep 13, 2026 23:331,54812,490,0302,799,0001,073,0002,117,632
5Sep 13, 2026 23:331,61322,300,6682,927,0001,107,0002,117,632
6Sep 13, 2026 23:331,62512,741,6192,971,0001,092,0002,117,632
7Sep 13, 2026 23:331,67312,777,3833,097,0001,086,0002,117,632
8Sep 13, 2026 23:331,67512,793,1383,098,0001,090,0002,117,632
9Sep 13, 2026 23:331,67612,767,1573,098,0001,092,0002,117,632