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 9, 2026 12:41olliecrowolliecrowScore: 5,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 12:415,68741,830,16912,187,0002,031,0002,314,240
2Apr 9, 2026 12:415,69941,794,09113,231,0001,017,0002,412,544
3Apr 9, 2026 12:415,70630,011,27212,227,0002,037,0002,416,640
4Apr 9, 2026 12:415,71335,576,24212,242,0002,040,0002,416,640
5Apr 9, 2026 12:415,71638,380,67112,248,0002,041,0002,416,640
6Apr 9, 2026 12:415,76137,511,09213,374,0001,028,0002,424,832
7Apr 9, 2026 12:415,77838,101,75912,381,0002,063,0002,342,912
8Apr 9, 2026 12:415,79235,561,67112,413,0002,068,0002,420,736
9Apr 9, 2026 12:415,79830,643,65213,459,0001,035,0002,314,240