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 00:59Tomislav TunkovicTomislav TunkovicScore: 1,492Success
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 01:171,38111,665,0253,454,0000524,288
2Aug 31, 2026 01:171,38211,682,2913,456,0000524,288
3Aug 31, 2026 01:171,38211,586,5573,455,0000524,288
4Aug 31, 2026 01:171,47911,892,8813,699,0000524,288
5Aug 31, 2026 01:171,49211,889,9573,732,0000524,288
6Aug 31, 2026 01:171,49611,896,4763,740,0000524,288
7Aug 31, 2026 01:171,53011,983,4553,826,0000524,288
8Aug 31, 2026 01:171,53411,944,5313,835,0000524,288
9Aug 31, 2026 01:171,54612,019,5423,866,0000524,288