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 listMay 20, 2026 10:53Jacob McDanielJacob McDanielScore: 2,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:532,74717,356,5255,746,0001,123,0002,117,632
2May 20, 2026 10:532,75417,957,0075,683,0001,203,0002,117,632
3May 20, 2026 10:532,75816,180,2935,711,0001,184,0002,117,632
4May 20, 2026 10:532,76119,072,3675,720,0001,184,0002,117,632
5May 20, 2026 10:532,79118,250,6495,742,0001,236,0002,117,632
6May 20, 2026 10:532,79417,978,8185,741,0001,244,0002,117,632
7May 20, 2026 10:532,82818,038,1355,813,0001,259,0002,117,632
8May 20, 2026 10:532,85218,753,7665,849,0001,282,0002,117,632
9May 20, 2026 10:532,85617,647,0536,004,0001,138,0002,117,632