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 listSep 10, 2026 03:00Andrew EpsteinAndrew EpsteinScore: 1,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 03:001,75214,647,6583,127,0001,253,0002,125,824
2Sep 10, 2026 03:001,75314,469,3053,130,0001,253,0002,121,728
3Sep 10, 2026 03:001,75414,546,7603,130,0001,255,0002,121,728
4Sep 10, 2026 03:001,75514,590,8783,133,0001,256,0002,121,728
5Sep 10, 2026 03:001,76014,621,1073,143,0001,259,0002,121,728
6Sep 10, 2026 03:001,90215,728,7813,423,0001,333,0002,125,824
7Sep 10, 2026 03:001,91216,217,5643,433,0001,349,0002,121,728
8Sep 10, 2026 03:001,91215,004,6823,429,0001,351,0002,121,728
9Sep 10, 2026 03:001,94315,828,9053,695,0001,164,0002,121,728