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 listOct 9, 2026 07:37Karthik ReddyKarthik ReddyScore: 1,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 07:391,21211,738,6541,812,0001,219,000524,288
2Oct 9, 2026 07:391,23011,717,6681,632,0001,444,000524,288
3Oct 9, 2026 07:391,23411,787,2001,842,0001,243,000524,288
4Oct 9, 2026 07:391,45112,202,3752,486,0001,142,000524,288
5Oct 9, 2026 07:391,45712,273,1022,504,0001,139,000524,288
6Oct 9, 2026 07:391,45911,995,7652,506,0001,142,000524,288
7Oct 9, 2026 07:391,46212,209,1602,512,0001,143,000524,288
8Oct 9, 2026 07:391,46212,089,9422,513,0001,143,000524,288
9Oct 9, 2026 07:391,46812,259,7172,515,0001,155,000524,288