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:13Karthik ReddyKarthik ReddyScore: 1,447Success
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:131,41512,489,6192,297,0001,242,000524,288
2Oct 7, 2026 22:131,42312,517,1152,305,0001,254,000524,288
3Oct 7, 2026 22:131,42412,599,3172,300,0001,261,000524,288
4Oct 7, 2026 22:131,43912,506,2742,343,0001,255,000524,288
5Oct 7, 2026 22:131,44712,470,4912,518,0001,101,000524,288
6Oct 7, 2026 22:131,52012,747,6012,515,0001,286,000524,288
7Oct 7, 2026 22:131,57212,799,7002,674,0001,256,000524,288
8Oct 7, 2026 22:131,67213,008,6272,924,0001,256,000524,288
9Oct 7, 2026 22:131,72313,730,7133,001,0001,307,000524,288