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 26, 2026 20:24TudyMTudyMScore: 497,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 20:24497,4991,263,611,6671,242,749,000999,0002,560,000
2Apr 26, 2026 20:24497,5301,261,086,8821,242,827,000999,0002,338,816
3Apr 26, 2026 20:24497,5791,261,286,3881,242,949,000999,0002,330,624
4Apr 26, 2026 20:24497,6101,258,767,0421,243,026,000999,0002,551,808
5Apr 26, 2026 20:24497,6411,261,855,7961,242,105,0001,998,0002,330,624
6Apr 26, 2026 20:24497,6641,262,980,1031,241,164,0002,997,0002,555,904
7Apr 26, 2026 20:24497,7111,261,359,2311,242,281,0001,998,0002,555,904
8Apr 26, 2026 20:24497,9481,267,615,9191,242,871,0001,999,0002,551,808
9Apr 26, 2026 20:24498,1131,266,629,2381,242,286,0002,998,0002,322,432