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 listAug 1, 2026 05:35Victor MerckléVictor MerckléScore: 1,696Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 05:371,66012,876,5662,991,0001,159,0002,117,632stderr
2Aug 1, 2026 05:371,66412,667,8923,000,0001,161,0002,117,632stderr
3Aug 1, 2026 05:371,68112,689,6183,056,0001,148,0002,117,632stderr
4Aug 1, 2026 05:371,68213,523,3233,073,0001,134,0002,117,632stderr
5Aug 1, 2026 05:371,69612,770,5033,103,0001,137,0002,117,632stderr
6Aug 1, 2026 05:371,70714,357,2643,139,0001,129,0002,117,632stderr
7Aug 1, 2026 05:371,71713,496,6293,133,0001,161,0002,117,632stderr
8Aug 1, 2026 05:371,76313,607,6463,280,0001,129,0002,117,632stderr
9Aug 1, 2026 05:371,78214,201,3453,329,0001,127,0002,117,632stderr