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 15, 2026 07:38olliecrowolliecrowScore: 4,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 07:384,58032,495,7619,368,0002,081,0002,277,376
2Apr 15, 2026 07:384,76431,836,75510,918,000992,0002,387,968
3Apr 15, 2026 07:384,87526,762,11310,156,0002,031,0002,482,176