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 listApr 24, 2026 02:52olliecrowolliecrowScore: 4,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 02:554,66029,879,2219,532,0002,118,0002,363,392
2Apr 24, 2026 02:554,78330,733,5647,972,0003,986,0002,535,424
3Apr 24, 2026 02:554,85332,291,1299,100,0003,033,0002,535,424
4Apr 24, 2026 02:554,86531,166,6028,109,0004,054,0002,527,232
5Apr 24, 2026 02:554,87433,350,5337,109,0005,077,0002,555,904
6Apr 24, 2026 02:554,88534,465,0518,143,0004,071,0002,539,520
7Apr 24, 2026 02:554,92830,461,8269,242,0003,080,0002,547,712
8Apr 24, 2026 02:555,01032,317,45210,438,0002,087,0002,535,424
9Apr 24, 2026 02:555,11229,035,8707,866,0004,916,0002,338,816