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 20, 2026 16:46M-RochatM-RochatScore: 6,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:466,66025,950,06015,380,0001,271,0002,113,536
2May 20, 2026 16:466,66225,880,89915,387,0001,268,0002,113,536
3May 20, 2026 16:466,66325,855,04715,384,0001,275,0002,113,536
4May 20, 2026 16:466,66325,924,18515,374,0001,285,0002,113,536
5May 20, 2026 16:466,67226,730,84215,396,0001,284,0002,113,536
6May 20, 2026 16:466,67626,402,75215,407,0001,284,0002,113,536
7May 20, 2026 16:466,67826,685,12515,381,0001,314,0002,113,536
8May 20, 2026 16:466,68026,527,99315,398,0001,303,0002,113,536
9May 20, 2026 16:466,68326,485,99815,409,0001,300,0002,113,536