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 30, 2026 23:44Tomislav TunkovicTomislav TunkovicScore: 1,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 23:501,39911,788,3303,499,0000524,288
2Aug 30, 2026 23:501,48712,074,8443,719,0000524,288
3Aug 30, 2026 23:501,50212,028,8683,756,0000524,288
4Aug 30, 2026 23:501,51212,085,1873,780,0000524,288
5Aug 30, 2026 23:501,52812,081,5453,821,0000524,288
6Aug 30, 2026 23:501,53612,727,3853,842,0000524,288
7Aug 30, 2026 23:501,55012,176,3173,876,0000524,288
8Aug 30, 2026 23:501,55112,124,4273,878,0000524,288
9Aug 30, 2026 23:501,56012,332,9033,902,0000524,288