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 5, 2026 00:50olliecrowolliecrowScore: 4,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 00:563,95826,502,6217,514,0002,383,0002,396,160
2May 5, 2026 00:563,99626,104,3577,544,0002,448,0002,392,064
3May 5, 2026 00:563,99726,771,5447,560,0002,433,0002,392,064
4May 5, 2026 00:564,00726,946,6007,505,0002,513,0002,396,160
5May 5, 2026 00:564,08426,339,8597,681,0002,529,0002,387,968
6May 5, 2026 00:564,15429,536,8867,820,0002,566,0002,396,160
7May 5, 2026 00:564,18529,389,0097,807,0002,657,0002,392,064
8May 5, 2026 00:564,19027,002,5547,861,0002,614,0002,400,256
9May 5, 2026 00:564,19227,164,2117,852,0002,628,0002,400,256