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 16:26M-RochatM-RochatScore: 4,554Success
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 16:264,53820,707,24410,258,0001,087,0002,117,632
2May 20, 2026 16:264,54220,684,83510,270,0001,086,0002,121,728
3May 20, 2026 16:264,54420,917,69910,274,0001,086,0002,117,632
4May 20, 2026 16:264,54920,695,46810,284,0001,089,0002,117,632
5May 20, 2026 16:264,55420,710,82310,298,0001,089,0002,121,728
6May 20, 2026 16:264,55420,741,91310,297,0001,089,0002,117,632
7May 20, 2026 16:264,67620,991,06010,595,0001,097,0002,121,728
8May 20, 2026 16:264,68621,543,13410,616,0001,099,0002,117,632
9May 20, 2026 16:264,70221,577,23310,657,0001,099,0002,121,728