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 10, 2026 23:47Elijah KinElijah KinScore: 12,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 23:4812,78343,241,68929,853,0002,106,0002,113,536
2May 10, 2026 23:4812,81242,514,88329,825,0002,207,0002,113,536
3May 10, 2026 23:4812,84341,203,69329,896,0002,213,0002,113,536
4May 10, 2026 23:4812,89340,739,11530,133,0002,101,0002,113,536
5May 10, 2026 23:4812,92140,968,71930,058,0002,246,0002,113,536
6May 10, 2026 23:4812,92241,633,05530,103,0002,203,0002,113,536
7May 10, 2026 23:4812,98441,761,48230,175,0002,287,0002,113,536
8May 10, 2026 23:4812,98441,264,68430,199,0002,261,0002,113,536
9May 10, 2026 23:4813,07341,967,66229,616,0003,068,0002,113,536