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 26, 2026 17:04Elijah KinElijah KinScore: 9,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2026 17:049,15533,983,35518,455,0004,433,0002,113,536
2May 26, 2026 17:049,21433,213,56918,770,0004,265,0002,113,536
3May 26, 2026 17:049,23034,211,71018,831,0004,245,0002,113,536
4May 26, 2026 17:049,25532,869,19318,902,0004,237,0002,113,536
5May 26, 2026 17:049,33834,288,39219,104,0004,241,0002,113,536
6May 26, 2026 17:049,39033,706,95719,170,0004,306,0002,113,536
7May 26, 2026 17:049,61633,705,87318,828,0005,214,0002,113,536
8May 26, 2026 17:049,65134,677,48419,865,0004,263,0002,113,536
9May 26, 2026 17:049,74835,474,63819,900,0004,470,0002,113,536