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 listApr 13, 2026 04:55limanjun99limanjun99Score: 4,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 04:554,12631,699,5957,221,0003,094,0002,285,568
2Apr 13, 2026 04:554,13226,168,2649,297,0001,033,0002,453,504
3Apr 13, 2026 04:554,14532,036,0518,291,0002,072,0002,396,160
4Apr 13, 2026 04:554,14629,436,7667,255,0003,109,0002,392,064
5Apr 13, 2026 04:554,15821,881,8199,357,0001,039,0002,506,752
6Apr 13, 2026 04:554,16630,426,5717,291,0003,124,0002,289,664
7Apr 13, 2026 04:554,21227,009,7478,424,0002,106,0002,387,968
8Apr 13, 2026 04:554,22632,933,5278,453,0002,113,0002,506,752
9Apr 13, 2026 04:554,23936,454,4098,479,0002,119,0002,502,656