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 01:28olliecrowolliecrowScore: 3,914Success
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 01:323,74523,091,9978,189,0001,174,0002,392,064
2May 5, 2026 01:323,85327,031,3627,347,0002,287,0002,400,256
3May 5, 2026 01:323,86723,333,9457,373,0002,296,0002,404,352
4May 5, 2026 01:323,89028,364,1707,437,0002,290,0002,404,352
5May 5, 2026 01:323,91426,371,5087,533,0002,253,0002,408,448
6May 5, 2026 01:323,92228,541,1417,471,0002,335,0002,400,256
7May 5, 2026 01:323,97628,476,0517,537,0002,405,0002,400,256
8May 5, 2026 01:324,02227,975,2697,626,0002,431,0002,400,256
9May 5, 2026 01:324,12426,038,4667,806,0002,506,0002,387,968