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 05:53Elijah KinElijah KinScore: 17,012Success
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 05:5316,93872,828,45530,527,00011,817,0004,046,848
2Mar 15, 2026 05:5317,01275,157,37327,694,00014,836,0003,731,456
3Mar 15, 2026 05:5317,27570,962,93231,135,00012,052,0003,776,512