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 listAug 31, 2026 02:12Tomislav TunkovicTomislav TunkovicScore: 1,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 02:221,79212,718,6463,191,0001,289,000552,960
2Aug 31, 2026 02:221,79912,797,2013,202,0001,297,000552,960
3Aug 31, 2026 02:221,93313,125,6123,596,0001,237,000552,960
4Aug 31, 2026 02:221,94213,116,7283,606,0001,249,000552,960
5Aug 31, 2026 02:221,96113,616,8653,670,0001,234,000552,960
6Aug 31, 2026 02:221,96213,163,9783,671,0001,235,000552,960
7Aug 31, 2026 02:221,96813,202,1963,676,0001,246,000552,960
8Aug 31, 2026 02:221,97613,158,2563,700,0001,242,000552,960
9Aug 31, 2026 02:221,97813,199,0373,689,0001,256,000552,960