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 listAug 27, 2026 17:00Elijah KinElijah KinScore: 3,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:012,89917,055,2696,032,0001,216,0002,117,632
2Aug 27, 2026 17:012,90217,075,4316,036,0001,219,0002,117,632
3Aug 27, 2026 17:012,92417,084,2056,082,0001,229,0002,117,632
4Aug 27, 2026 17:013,07217,439,9086,453,0001,228,0002,117,632
5Aug 27, 2026 17:013,08617,620,8436,490,0001,227,0002,117,632
6Aug 27, 2026 17:013,13417,653,5966,592,0001,243,0002,117,632
7Aug 27, 2026 17:013,14217,677,0166,627,0001,230,0002,117,632
8Aug 27, 2026 17:013,18317,790,5376,706,0001,252,0002,117,632
9Aug 27, 2026 17:013,20517,835,6206,756,0001,257,0002,117,632