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 6, 2026 18:56olliecrowolliecrowScore: 15,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 18:5615,67963,969,94136,183,0003,015,0002,424,832
2Apr 6, 2026 18:5615,76862,050,43236,388,0003,032,0002,379,776
3Apr 6, 2026 18:5616,07462,980,16936,168,0004,018,0002,322,432