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 listJul 17, 2026 21:19Elijah KinElijah KinScore: 2,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 21:192,77316,554,8885,672,0001,261,0002,117,632
2Jul 17, 2026 21:192,84816,718,2275,854,0001,268,0002,117,632
3Jul 17, 2026 21:192,92516,995,3226,071,0001,243,0002,117,632
4Jul 17, 2026 21:192,92816,953,1516,054,0001,268,0002,117,632
5Jul 17, 2026 21:192,92916,954,5226,075,0001,248,0002,117,632
6Jul 17, 2026 21:192,94417,049,8996,080,0001,282,0002,117,632
7Jul 17, 2026 21:192,94517,039,2346,109,0001,255,0002,117,632
8Jul 17, 2026 21:192,94617,040,0426,107,0001,258,0002,117,632
9Jul 17, 2026 21:192,94917,026,4866,105,0001,268,0002,117,632