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 20, 2026 15:31olliecrowolliecrowScore: 13,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:3413,20557,880,35630,012,0003,001,0002,387,968
2Apr 20, 2026 15:3413,21160,446,35231,028,0002,001,0002,478,080
3Apr 20, 2026 15:3413,38954,511,92232,459,0001,014,0002,392,064
4Apr 20, 2026 15:3413,39860,166,57331,465,0002,030,0002,387,968
5Apr 20, 2026 15:3413,41052,512,65332,510,0001,015,0002,400,256
6Apr 20, 2026 15:3413,43859,480,36331,560,0002,036,0002,387,968
7Apr 20, 2026 15:3413,48462,404,53632,691,0001,021,0002,392,064
8Apr 20, 2026 15:3413,54960,146,95730,886,0002,988,0002,289,664
9Apr 20, 2026 15:3413,55062,139,40530,887,0002,989,0002,387,968