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 listApr 19, 2026 09:11olliecrowolliecrowScore: 4,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 09:114,89031,504,94910,188,0002,037,0002,293,760
2Apr 19, 2026 09:114,96630,476,1428,277,0004,138,0002,326,528
3Apr 19, 2026 09:115,06229,522,2199,491,0003,163,0002,281,472