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 15, 2026 06:44olliecrowolliecrowScore: 4,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 06:444,45428,594,1327,086,0004,049,0002,482,176
2Apr 15, 2026 06:444,45926,523,8308,108,0003,040,0002,445,312
3Apr 15, 2026 06:444,48028,678,0299,165,0002,036,0002,478,080
4Apr 15, 2026 06:444,52432,452,2419,253,0002,056,0002,465,792
5Apr 15, 2026 06:444,65027,504,1359,512,0002,113,0002,490,368
6Apr 15, 2026 06:444,70229,069,64710,687,0001,068,0002,482,176
7Apr 15, 2026 06:444,76233,688,74110,912,000992,0002,375,680
8Apr 15, 2026 06:444,76628,869,2517,944,0003,972,0002,482,176
9Apr 15, 2026 06:444,80636,325,5929,012,0003,004,0002,375,680