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 29, 2026 05:37Elijah KinElijah KinScore: 5,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 05:394,86821,318,6629,924,0002,247,0002,113,536
2May 29, 2026 05:394,90823,420,1799,162,0003,108,0002,113,536
3May 29, 2026 05:394,97521,614,8359,171,0003,267,0002,113,536
4May 29, 2026 05:395,11722,901,8369,550,0003,243,0002,113,536
5May 29, 2026 05:395,27426,560,18210,960,0002,225,0002,117,632
6May 29, 2026 05:395,30223,358,8789,969,0003,288,0002,113,536
7May 29, 2026 05:395,36825,607,37310,343,0003,079,0002,113,536
8May 29, 2026 05:395,48623,464,36710,475,0003,242,0002,113,536
9May 29, 2026 05:395,50825,086,51810,544,0003,227,0002,113,536