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 listAug 27, 2026 21:14Elijah KinElijah KinScore: 2,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 21:152,02714,985,7073,828,0001,240,0002,117,632
2Aug 27, 2026 21:152,09415,038,7583,962,0001,274,0002,117,632
3Aug 27, 2026 21:152,13015,118,0684,067,0001,260,0002,117,632
4Aug 27, 2026 21:152,20615,366,2954,249,0001,267,0002,117,632
5Aug 27, 2026 21:152,21915,714,1344,298,0001,250,0002,117,632
6Aug 27, 2026 21:152,24815,354,9044,370,0001,251,0002,117,632
7Aug 27, 2026 21:152,25715,420,3814,402,0001,242,0002,117,632
8Aug 27, 2026 21:152,29915,552,5254,505,0001,243,0002,117,632
9Aug 27, 2026 21:152,30515,553,6874,501,0001,263,0002,117,632