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 22, 2026 07:48Dominique GarmierDominique GarmierScore: 82,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 07:5882,362227,906,836202,906,0002,998,0002,523,136
2Mar 22, 2026 07:4882,367234,005,588202,920,0002,998,0002,297,856
3Mar 22, 2026 11:4082,437232,554,199203,092,0003,001,0002,371,584
4Mar 22, 2026 11:4082,447234,802,662204,116,0002,001,0002,375,680
5Mar 22, 2026 07:5882,458231,416,122202,143,0004,002,0002,301,952
6Mar 22, 2026 07:4882,537233,756,524204,339,0002,003,0002,527,232
7Mar 22, 2026 07:4882,568236,664,227204,415,0002,004,0002,527,232
8Mar 22, 2026 11:4082,617230,846,287204,537,0002,005,0002,531,328
9Mar 22, 2026 07:5883,432248,623,787202,622,0005,959,0002,510,848