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 22:13Andrew EpsteinAndrew EpsteinScore: 1,300Success
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 22:151,21712,224,2833,043,00002,121,728stderr
2Nov 2, 2026 22:151,22112,194,9713,054,00002,121,728stderr
3Nov 2, 2026 22:151,29612,363,9213,241,00002,121,728stderr
4Nov 2, 2026 22:151,29812,459,4223,245,00002,121,728stderr
5Nov 2, 2026 22:151,30012,348,5383,250,00002,121,728stderr
6Nov 2, 2026 22:151,33212,827,5501,921,0001,409,0002,121,728stderr
7Nov 2, 2026 22:151,33212,847,3871,919,0001,411,0002,121,728stderr
8Nov 2, 2026 22:151,33612,489,2491,920,0001,422,0002,121,728stderr
9Nov 2, 2026 22:151,33712,503,2341,921,0001,422,0002,121,728stderr