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 10, 2026 05:01olliecrowolliecrowScore: 11,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 05:0111,19948,987,15724,998,0002,999,0002,318,336
2Mar 10, 2026 05:0111,22152,737,80626,050,0002,003,0002,519,040
3Mar 10, 2026 05:0111,24548,942,96125,100,0003,012,0002,330,624
4Mar 10, 2026 05:0111,26455,378,59623,132,0005,028,0002,494,464
5Mar 10, 2026 05:0111,26852,806,35326,158,0002,012,0002,322,432
6Mar 10, 2026 05:0111,31151,247,55925,249,0003,029,0002,334,720
7Mar 10, 2026 05:0111,31552,019,14524,247,0004,041,0002,318,336
8Mar 10, 2026 05:0111,32851,257,69724,274,0004,045,0002,306,048
9Mar 10, 2026 05:0111,35753,713,05326,364,0002,028,0002,314,240