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 00:52Elijah KinElijah KinScore: 62,672Success
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 00:5262,633180,665,819155,579,0001,003,0002,310,144
2Mar 15, 2026 00:5262,672187,589,298154,671,0002,008,0002,527,232
3Mar 15, 2026 00:5262,774183,969,949153,938,0002,998,0002,527,232