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 17, 2026 17:27Jacob McDanielJacob McDanielScore: 3,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 17:273,61818,242,4606,834,0002,211,0002,121,728
2May 17, 2026 17:273,62818,411,8706,815,0002,256,0002,121,728
3May 17, 2026 17:273,65818,529,1716,893,0002,254,0002,121,728
4May 17, 2026 17:273,67819,534,0186,919,0002,277,0002,113,536
5May 17, 2026 17:273,70020,750,2986,990,0002,262,0002,121,728
6May 17, 2026 17:273,88618,940,2517,428,0002,287,0002,121,728
7May 17, 2026 17:273,92019,164,5837,480,0002,320,0002,121,728
8May 17, 2026 17:274,01921,405,9817,657,0002,391,0002,121,728
9May 17, 2026 17:274,04221,036,1437,729,0002,376,0002,121,728