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 22:36Elijah KinElijah KinScore: 2,694Success
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 22:372,49016,105,0934,050,0002,177,0002,117,632
2Aug 27, 2026 22:372,62316,733,9855,067,0001,492,0002,117,632
3Aug 27, 2026 22:372,69016,590,2875,185,0001,540,0002,117,632
4Aug 27, 2026 22:372,69116,944,8625,189,0001,539,0002,117,632
5Aug 27, 2026 22:372,69417,015,7635,207,0001,528,0002,117,632
6Aug 27, 2026 22:372,72017,014,9195,273,0001,527,0002,117,632
7Aug 27, 2026 22:372,76517,180,0085,376,0001,537,0002,117,632
8Aug 27, 2026 22:372,78117,389,1905,284,0001,670,0002,117,632
9Aug 27, 2026 22:373,13218,412,0376,068,0001,763,0002,117,632