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 19, 2026 15:00Elijah KinElijah KinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 15:00060,569,45643,960,0003,350,0002,113,536pos 0: expected 142 got 148
2May 19, 2026 15:00057,103,65943,742,0003,163,0002,113,536pos 0: expected 235 got 9
3May 19, 2026 15:00058,657,12643,835,0003,198,0002,113,536pos 0: expected 160 got 130