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 14, 2026 15:58Dominique GarmierDominique GarmierScore: 451,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 15:58451,0191,149,288,4471,125,548,0001,999,0002,273,280
2Mar 14, 2026 15:58451,3661,157,289,7741,126,417,0001,998,0002,433,024
3Mar 14, 2026 15:58451,4781,156,283,7471,127,695,000999,0002,437,120
4Mar 14, 2026 15:58451,4841,151,496,4561,127,711,000999,0002,273,280
5Mar 14, 2026 15:58451,7141,156,143,9851,127,286,0001,998,0002,273,280
6Mar 14, 2026 15:58451,9371,152,225,6751,128,844,000999,0002,273,280
7Mar 14, 2026 15:58451,9781,155,629,2691,128,947,000999,0002,441,216
8Mar 14, 2026 15:58452,0741,156,600,4421,128,186,0001,998,0002,273,280
9Mar 14, 2026 15:58452,0961,159,776,0221,128,241,0001,998,0002,445,312