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 17:09Elijah KinElijah KinScore: 2,320Success
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 17:102,28815,412,2924,474,0001,247,0002,117,632
2Aug 27, 2026 17:102,30715,503,9664,519,0001,249,0002,117,632
3Aug 27, 2026 17:102,31115,818,5964,508,0001,270,0002,117,632
4Aug 27, 2026 17:102,32015,660,6784,552,0001,250,0002,117,632
5Aug 27, 2026 17:102,32016,368,8284,544,0001,256,0002,117,632
6Aug 27, 2026 17:102,33015,594,7304,574,0001,252,0002,117,632
7Aug 27, 2026 17:102,33415,645,0154,565,0001,272,0002,117,632
8Aug 27, 2026 17:102,39716,420,2724,874,0001,119,0002,117,632
9Aug 27, 2026 17:102,42216,598,9844,728,0001,327,0002,117,632