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 listSep 14, 2026 09:52Victor MerckléVictor MerckléScore: 1,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 09:531,39012,266,9232,419,0001,057,0002,121,728stderr
2Sep 14, 2026 09:531,39312,211,9022,413,0001,070,0002,121,728stderr
3Sep 14, 2026 09:531,39512,071,4642,413,0001,075,0002,121,728stderr
4Sep 14, 2026 09:531,40012,320,4892,425,0001,075,0002,121,728stderr
5Sep 14, 2026 09:531,46612,381,7612,579,0001,086,0002,121,728stderr
6Sep 14, 2026 09:531,47012,400,7302,524,0001,153,0002,121,728stderr
7Sep 14, 2026 09:531,47612,471,0012,606,0001,085,0002,121,728stderr
8Sep 14, 2026 09:531,48712,264,1842,616,0001,102,0002,121,728stderr
9Sep 14, 2026 09:531,53812,394,8412,744,0001,102,0002,121,728stderr