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 listMay 17, 2026 15:35Jacob McDanielJacob McDanielScore: 7,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:357,24930,219,42215,897,0002,226,0002,113,536
2May 17, 2026 15:357,30428,436,44416,018,0002,242,0002,113,536
3May 17, 2026 15:357,32828,952,47416,093,0002,229,0002,113,536
4May 17, 2026 15:357,33729,504,67616,066,0002,277,0002,113,536
5May 17, 2026 15:357,34230,564,18216,106,0002,251,0002,113,536
6May 17, 2026 15:357,36227,971,58216,173,0002,233,0002,113,536
7May 17, 2026 15:357,38030,007,89816,217,0002,234,0002,113,536
8May 17, 2026 15:357,38229,688,92716,232,0002,225,0002,113,536
9May 17, 2026 15:357,41728,563,53516,327,0002,217,0002,113,536