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 21, 2026 21:57Jacob McDanielJacob McDanielScore: 2,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 21:572,41917,368,8094,859,0001,190,0002,117,632
2May 21, 2026 21:572,44315,878,5724,911,0001,198,0002,117,632
3May 21, 2026 21:572,44815,401,7094,916,0001,205,0002,117,632
4May 21, 2026 21:572,46616,651,9814,953,0001,212,0002,117,632
5May 21, 2026 21:572,54816,093,3495,111,0001,261,0002,117,632
6May 21, 2026 21:572,57016,278,1795,158,0001,268,0002,117,632
7May 21, 2026 21:572,58127,948,8335,221,0001,233,0002,117,632
8May 21, 2026 21:572,58215,895,2215,171,0001,284,0002,117,632
9May 21, 2026 21:572,61417,159,2055,261,0001,274,0002,117,632