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 12, 2026 02:31olliecrowolliecrowScore: 8,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 02:318,67353,895,90217,553,0004,130,0002,523,136
2Mar 12, 2026 02:318,75748,644,05418,908,0002,985,0002,523,136
3Mar 12, 2026 02:318,76547,491,23018,925,0002,988,0002,416,640
4Mar 12, 2026 02:318,78047,034,99019,955,0001,995,0002,523,136
5Mar 12, 2026 02:318,79050,131,62019,978,0001,997,0002,265,088
6Mar 12, 2026 02:318,83851,822,41718,079,0004,017,0002,400,256
7Mar 12, 2026 02:318,84049,422,70119,086,0003,013,0002,523,136
8Mar 12, 2026 02:318,87249,011,35120,163,0002,016,0002,519,040
9Mar 12, 2026 02:318,88751,622,24019,188,0003,029,0002,404,352