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 4, 2026 21:54olliecrowolliecrowScore: 3,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 21:573,64425,867,1167,957,0001,155,0002,371,584
2May 4, 2026 21:573,66828,963,0888,013,0001,158,0002,375,680
3May 4, 2026 21:573,78525,979,6958,294,0001,169,0002,375,680
4May 4, 2026 21:573,85728,370,2038,466,0001,177,0002,371,584
5May 4, 2026 21:573,87624,410,2427,570,0002,120,0002,367,488
6May 4, 2026 21:573,88628,122,1357,568,0002,149,0002,371,584
7May 4, 2026 21:573,95428,974,9117,772,0002,114,0002,379,776
8May 4, 2026 21:574,01824,405,9707,897,0002,148,0002,359,296
9May 4, 2026 21:574,10329,952,4478,011,0002,247,0002,371,584