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 listMay 30, 2026 02:35Elijah KinElijah KinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 02:36033,752,75620,668,0003,091,0002,113,536pos 0: expected 228 got 168
2May 30, 2026 02:36036,467,50620,595,0003,094,0002,113,536pos 0: expected 126 got 141
3May 30, 2026 02:36033,528,92420,623,0003,153,0002,113,536pos 0: expected 253 got 91