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 listMar 24, 2026 16:43Dominique GarmierDominique GarmierScore: 9,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 16:439,32049,580,07418,236,0005,065,0002,375,680
2Mar 24, 2026 16:439,34252,298,10519,294,0004,062,0002,371,584
3Mar 24, 2026 16:439,35250,073,25719,314,0004,066,0002,363,392