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 listJun 8, 2026 22:50Elijah KinElijah KinScore: 2,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 22:512,08614,278,3653,976,0001,239,0002,117,632
2Jun 8, 2026 22:512,08614,381,2883,973,0001,243,0002,117,632
3Jun 8, 2026 22:512,08914,423,2273,986,0001,238,0002,117,632
4Jun 8, 2026 22:512,11414,362,5244,021,0001,265,0002,117,632
5Jun 8, 2026 22:512,17014,589,2474,278,0001,148,0002,117,632
6Jun 8, 2026 22:512,18814,532,3834,198,0001,272,0002,117,632
7Jun 8, 2026 22:512,37615,005,0304,686,0001,254,0002,117,632
8Jun 8, 2026 22:512,39214,993,5554,827,0001,155,0002,117,632
9Jun 8, 2026 22:512,43815,142,6954,826,0001,270,0002,117,632