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 listMay 20, 2026 16:34M-RochatM-RochatScore: 4,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:344,55432,028,21710,302,0001,085,0002,121,728
2May 20, 2026 16:344,57335,767,12010,348,0001,085,0002,121,728
3May 20, 2026 16:344,57528,175,53510,350,0001,088,0002,117,632
4May 20, 2026 16:344,59428,311,21710,391,0001,094,0002,117,632
5May 20, 2026 16:344,61030,574,87310,435,0001,092,0002,117,632
6May 20, 2026 16:344,61435,261,62010,445,0001,092,0002,117,632
7May 20, 2026 16:344,72629,565,45010,717,0001,099,0002,117,632
8May 20, 2026 16:344,74435,957,14910,758,0001,102,0002,121,728
9May 20, 2026 16:344,77135,717,4509,909,0002,020,0002,117,632