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 listNov 2, 2026 23:43Andrew EpsteinAndrew EpsteinScore: 1,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2026 23:461,34412,442,6272,320,0001,042,0002,117,632
2Nov 2, 2026 23:461,36912,587,0242,378,0001,045,0002,117,632
3Nov 2, 2026 23:461,37112,555,0601,943,0001,485,0002,117,632
4Nov 2, 2026 23:461,37412,603,5912,322,0001,113,0002,117,632
5Nov 2, 2026 23:461,37412,556,1822,019,0001,416,0002,117,632
6Nov 2, 2026 23:461,37512,617,2952,390,0001,048,0002,117,632
7Nov 2, 2026 23:461,37612,625,5182,249,0001,193,0002,117,632
8Nov 2, 2026 23:461,38012,575,5352,387,0001,063,0002,117,632
9Nov 2, 2026 23:461,38212,570,6861,971,0001,485,0002,117,632