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 29, 2026 09:57Victor MerckléVictor MerckléScore: 2,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 09:582,68914,993,1195,376,0001,347,0002,113,536
2May 29, 2026 09:582,69114,466,8705,380,0001,349,0002,113,536
3May 29, 2026 09:582,69115,083,0075,378,0001,351,0002,113,536
4May 29, 2026 09:582,69814,986,3915,387,0001,358,0002,113,536
5May 29, 2026 09:582,71615,314,1275,436,0001,354,0002,113,536
6May 29, 2026 09:582,75214,692,8235,495,0001,385,0002,113,536
7May 29, 2026 09:582,80415,707,1875,665,0001,346,0002,113,536
8May 29, 2026 09:582,81817,380,2715,694,0001,352,0002,113,536
9May 29, 2026 09:582,86418,295,2334,841,0002,319,0002,113,536