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 listMar 19, 2026 06:25Dominique GarmierDominique GarmierScore: 14,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 06:2514,21759,938,97130,465,0005,077,0002,293,760
2Mar 19, 2026 06:2514,24662,090,31729,511,0006,105,0002,281,472
3Mar 19, 2026 06:2514,27564,658,24830,589,0005,098,0002,387,968
4Mar 19, 2026 06:2514,28761,947,61431,635,0004,082,0002,293,760
5Mar 19, 2026 06:2514,31763,355,95730,821,0004,971,0002,314,240
6Mar 19, 2026 06:2514,35668,207,07130,905,0004,984,0002,433,024
7Mar 19, 2026 06:2514,38162,536,38428,962,0006,990,0002,490,368
8Mar 19, 2026 06:2514,42860,688,29233,064,0003,005,0002,277,376
9Mar 19, 2026 06:2514,46162,536,60630,128,0006,025,0002,400,256