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 7, 2026 15:33Elijah KinElijah KinScore: 2,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 15:342,44815,172,0545,017,0001,103,0002,117,632
2Jun 7, 2026 15:342,47315,236,2035,077,0001,106,0002,117,632
3Jun 7, 2026 15:342,48415,308,3235,104,0001,108,0002,117,632
4Jun 7, 2026 15:342,54115,634,2835,254,0001,100,0002,117,632
5Jun 7, 2026 15:342,58115,526,5265,347,0001,106,0002,117,632
6Jun 7, 2026 15:342,64115,724,2225,510,0001,094,0002,117,632
7Jun 7, 2026 15:342,65815,711,9245,544,0001,101,0002,117,632
8Jun 7, 2026 15:342,68016,210,4105,599,0001,102,0002,117,632
9Jun 7, 2026 15:342,68217,569,1355,603,0001,102,0002,117,632