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 29, 2026 21:49Victor MerckléVictor MerckléScore: 2,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 21:512,52814,227,1474,994,0001,328,0002,113,536
2May 29, 2026 21:512,53615,983,4475,012,0001,329,0002,113,536
3May 29, 2026 21:512,54016,160,6105,021,0001,329,0002,113,536
4May 29, 2026 21:512,56016,009,1345,067,0001,334,0002,113,536
5May 29, 2026 21:512,57616,856,6355,091,0001,351,0002,113,536
6May 29, 2026 21:512,59715,373,7195,134,0001,359,0002,113,536
7May 29, 2026 21:512,60416,035,8895,144,0001,367,0002,113,536
8May 29, 2026 21:512,64115,998,5525,274,0001,330,0002,113,536
9May 29, 2026 21:512,70515,086,4094,473,0002,290,0002,113,536