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 7, 2026 22:18Karthik ReddyKarthik ReddyScore: 1,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 22:191,24412,042,7331,864,0001,248,000524,288
2Oct 7, 2026 22:191,25012,114,4931,871,0001,256,000524,288
3Oct 7, 2026 22:191,25812,028,1081,886,0001,261,000524,288
4Oct 7, 2026 22:191,25912,065,4671,890,0001,259,000524,288
5Oct 7, 2026 22:191,26012,022,6401,893,0001,257,000524,288
6Oct 7, 2026 22:191,26112,086,2581,885,0001,268,000524,288
7Oct 7, 2026 22:191,26111,994,0622,126,0001,027,000524,288
8Oct 7, 2026 22:191,26611,981,5212,152,0001,013,000524,288
9Oct 7, 2026 22:191,40012,266,7272,348,0001,152,000524,288