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 17, 2026 22:33Jacob McDanielJacob McDanielScore: 2,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 22:332,90419,309,6826,092,0001,169,0002,117,632
2May 17, 2026 22:332,90517,165,1966,087,0001,177,0002,117,632
3May 17, 2026 22:332,90618,376,8236,088,0001,177,0002,117,632
4May 17, 2026 22:332,91618,696,4186,114,0001,178,0002,117,632
5May 17, 2026 22:332,93018,200,7256,127,0001,199,0002,117,632
6May 17, 2026 22:332,94818,858,7726,208,0001,164,0002,117,632
7May 17, 2026 22:332,98816,708,8176,200,0001,272,0002,117,632
8May 17, 2026 22:333,01119,853,2776,264,0001,265,0002,117,632
9May 17, 2026 22:333,01118,704,8506,368,0001,161,0002,117,632