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 13, 2026 08:16limanjun99limanjun99Score: 3,444Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 08:163,42929,425,6186,429,0002,143,0002,510,848
2Apr 13, 2026 08:163,44424,600,7317,534,0001,076,0002,351,104
3Apr 13, 2026 08:163,49028,363,0605,453,0003,271,0002,285,568