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 15, 2026 06:13Elijah KinElijah KinScore: 12,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 06:1312,84955,216,00230,116,0002,007,0002,482,176
2Mar 15, 2026 06:1312,90954,556,33928,238,0004,034,0002,289,664
3Mar 15, 2026 06:1312,91156,958,24928,244,0004,034,0002,265,088