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 23, 2026 06:34olliecrowolliecrowScore: 7,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 06:347,49145,199,06016,647,0002,080,0002,326,528
2Mar 23, 2026 06:347,55542,115,26614,911,0003,976,0002,326,528
3Mar 23, 2026 06:347,56145,419,37517,909,000994,0002,281,472
4Mar 23, 2026 06:347,59241,607,50815,984,0002,997,0002,359,296
5Mar 23, 2026 06:347,59645,531,99415,993,0002,998,0002,301,952
6Mar 23, 2026 06:347,88849,630,71016,607,0003,113,0002,297,856