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 27, 2026 16:46Elijah KinElijah KinScore: 6,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2026 16:486,64027,971,63313,304,0003,297,0002,113,536
2May 27, 2026 16:486,65227,674,97113,314,0003,316,0002,113,536
3May 27, 2026 16:486,66225,857,53213,329,0003,328,0002,113,536
4May 27, 2026 16:486,76427,916,71713,620,0003,291,0002,113,536
5May 27, 2026 16:486,90827,805,81613,932,0003,339,0002,113,536
6May 27, 2026 16:486,91329,269,82013,972,0003,311,0002,113,536
7May 27, 2026 16:487,00627,263,32914,356,0003,159,0002,113,536
8May 27, 2026 16:487,30828,290,58015,006,0003,264,0002,113,536
9May 27, 2026 16:487,45030,260,58015,315,0003,310,0002,113,536