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 listApr 17, 2026 02:51olliecrowolliecrowScore: 4,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 01:524,44433,421,4389,090,0002,020,0002,404,352
2Apr 17, 2026 01:524,47231,349,8039,148,0002,032,0002,506,752
3Apr 17, 2026 01:524,48626,619,1529,176,0002,039,0002,482,176
4Apr 17, 2026 01:524,49329,139,22810,211,0001,021,0002,486,272
5Apr 17, 2026 01:524,49726,170,9159,199,0002,044,0002,428,928
6Apr 17, 2026 01:524,69728,438,94811,742,00002,375,680
7Apr 17, 2026 02:514,75028,669,46910,885,000989,0002,367,488
8Apr 17, 2026 01:524,76229,132,0459,922,0001,984,0002,379,776
9Apr 17, 2026 01:524,76327,473,51510,915,000992,0002,355,200
10Apr 17, 2026 02:514,76327,073,90710,915,000992,0002,371,584
11Apr 17, 2026 01:524,76428,855,99210,918,000992,0002,371,584
12Apr 17, 2026 02:514,88136,332,7129,152,0003,050,0002,490,368