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 21, 2026 01:30Taylor DettlingTaylor DettlingScore: 401,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 01:30401,3111,028,817,8951,000,281,0002,997,0002,375,680
2Apr 21, 2026 01:30401,4251,026,511,9211,001,565,0001,999,0002,379,776
3Apr 21, 2026 01:30401,7011,031,510,2451,003,253,0001,000,0002,375,680