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 15, 2026 10:10Tomislav TunkovicTomislav TunkovicScore: 2,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 10:112,14914,878,0014,228,0001,145,0002,117,632
2Aug 15, 2026 10:112,16913,934,5284,265,0001,158,0002,117,632
3Aug 15, 2026 10:112,17213,687,2584,252,0001,179,0002,117,632
4Aug 15, 2026 10:112,27613,891,3784,494,0001,196,0002,117,632
5Aug 15, 2026 10:112,28214,172,1564,518,0001,187,0002,117,632
6Aug 15, 2026 10:112,29314,401,9394,576,0001,157,0002,117,632
7Aug 15, 2026 10:112,32614,982,1724,646,0001,169,0002,117,632
8Aug 15, 2026 10:112,33014,328,6934,651,0001,175,0002,117,632
9Aug 15, 2026 10:112,33814,266,0004,684,0001,163,0002,117,632