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 22:07Victor MerckléVictor MerckléScore: 1,438Success
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 22:221,33612,106,9561,838,0001,503,0002,117,632stderr
2Sep 14, 2026 22:221,37612,127,1291,882,0001,560,0002,117,632stderr
3Sep 14, 2026 22:221,39312,206,5001,938,0001,546,0002,117,632stderr
4Sep 14, 2026 22:221,42212,354,1852,009,0001,547,0002,117,632stderr
5Sep 14, 2026 22:221,43812,402,7742,067,0001,529,0002,117,632stderr
6Sep 14, 2026 22:221,43912,385,4922,084,0001,514,0002,117,632stderr
7Sep 14, 2026 22:221,45012,633,0392,084,0001,542,0002,117,632stderr
8Sep 14, 2026 22:221,45112,322,3342,065,0001,564,0002,117,632stderr
9Sep 14, 2026 22:221,53819,474,4572,621,0001,225,0002,117,632stderr