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 18:28olliecrowolliecrowScore: 24,981Success
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 18:3124,78687,019,14058,968,0002,998,0002,404,352
2Mar 4, 2026 18:3124,86284,806,73059,149,0003,007,0002,420,736
3Mar 4, 2026 18:2824,97888,445,20657,410,0005,035,0002,408,448
4Mar 4, 2026 18:2824,98187,319,27857,416,0005,036,0002,420,736
5Mar 4, 2026 18:3124,99586,426,44558,456,0004,031,0002,412,544
6Mar 4, 2026 18:2825,00989,175,08758,489,0004,033,0002,396,160