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:32Karthik ReddyKarthik ReddyScore: 1,225Success
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:331,20211,906,7661,783,0001,224,000524,288
2Oct 7, 2026 22:331,22211,967,5361,816,0001,241,000524,288
3Oct 7, 2026 22:331,22311,886,1821,810,0001,248,000524,288
4Oct 7, 2026 22:331,22311,904,7511,817,0001,241,000524,288
5Oct 7, 2026 22:331,22511,910,8561,818,0001,246,000524,288
6Oct 7, 2026 22:331,22611,817,8311,594,0001,473,000524,288
7Oct 7, 2026 22:331,22611,917,2601,818,0001,249,000524,288
8Oct 7, 2026 22:331,22613,801,0961,818,0001,247,000524,288
9Oct 7, 2026 22:331,25912,032,2201,640,0001,508,000524,288