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 29, 2026 23:39Dominique GarmierDominique GarmierScore: 214,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 23:06214,772562,723,769533,930,0002,999,0002,412,544
2Mar 29, 2026 23:06214,806562,476,508532,014,0005,000,0002,465,792
3Mar 29, 2026 23:39214,874561,785,875532,185,0005,001,0002,359,296
4Mar 29, 2026 23:39214,932569,226,862534,328,0003,001,0002,375,680
5Mar 29, 2026 23:39214,969565,132,768533,419,0004,003,0002,351,104
6Mar 29, 2026 23:06214,978564,620,332535,443,0002,001,0002,396,160