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 12, 2026 14:50limanjun99limanjun99Score: 38,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 14:5038,408120,618,87894,021,0002,000,000913,408
2Apr 12, 2026 14:5038,432123,623,67591,077,0005,004,000839,680
3Apr 12, 2026 14:5038,518121,667,93093,286,0003,009,000917,504