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 listMay 22, 2026 13:00M-RochatM-RochatScore: 4,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 13:014,36420,085,0359,834,0001,076,0002,117,632
2May 22, 2026 13:014,47420,418,03910,105,0001,082,0002,117,632
3May 22, 2026 13:014,47620,334,04810,104,0001,086,0002,117,632
4May 22, 2026 13:014,48620,486,68010,130,0001,087,0002,121,728
5May 22, 2026 13:014,49620,459,80110,154,0001,087,0002,117,632
6May 22, 2026 13:014,49720,437,03210,155,0001,088,0002,117,632
7May 22, 2026 13:014,51120,465,34010,187,0001,092,0002,117,632
8May 22, 2026 13:014,51120,456,94310,192,0001,087,0002,117,632
9May 22, 2026 13:014,51220,491,81610,193,0001,087,0002,117,632