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 listMar 4, 2026 19:36olliecrowolliecrowScore: 14,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 19:2813,99057,511,97429,979,0004,996,0002,408,448
2Mar 4, 2026 19:2813,99857,779,98931,996,0002,999,0002,408,448
3Mar 4, 2026 19:3613,99863,266,86331,997,0002,999,0002,396,160
4Mar 4, 2026 19:3614,01457,067,46031,032,0004,004,0002,408,448
5Mar 4, 2026 19:2814,01559,903,89431,034,0004,004,0002,314,240
6Mar 4, 2026 19:2814,01757,631,14530,036,0005,006,0002,383,872
7Mar 4, 2026 19:2814,01859,381,80430,038,0005,006,0002,383,872
8Mar 4, 2026 19:3614,02062,624,37432,046,0003,004,0002,383,872
9Mar 4, 2026 19:3614,02163,091,86731,047,0004,006,0002,404,352
10Mar 4, 2026 19:3614,02858,870,15630,061,0005,010,0002,408,448
11Mar 4, 2026 19:3614,07958,705,68131,176,0004,022,0002,404,352
12Mar 4, 2026 19:3614,08659,732,06532,196,0003,018,0002,412,544
13Mar 4, 2026 19:2814,08958,414,52532,203,0003,019,0002,387,968
14Mar 4, 2026 19:2814,10360,914,77330,221,0005,036,0002,318,336
15Mar 4, 2026 19:3614,11057,943,37530,237,0005,039,0002,400,256
16Mar 4, 2026 19:2814,11658,487,73030,249,0005,041,0002,387,968
17Mar 4, 2026 19:3614,13359,275,04730,286,0005,047,0002,383,872
18Mar 4, 2026 19:2814,19666,101,81628,392,0007,098,0002,412,544