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 17:05Tomislav TunkovicTomislav TunkovicScore: 1,704Success
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 17:061,58812,306,1123,971,0000524,288
2Aug 15, 2026 17:061,58812,351,0813,970,0000524,288
3Aug 15, 2026 17:061,58812,270,8933,972,0000524,288
4Aug 15, 2026 17:061,63212,396,9034,081,0000524,288
5Aug 15, 2026 17:061,70412,534,4894,262,0000524,288
6Aug 15, 2026 17:061,71012,487,1974,276,0000524,288
7Aug 15, 2026 17:061,71912,502,5784,299,0000524,288
8Aug 15, 2026 17:061,72212,574,2904,306,0000524,288
9Aug 15, 2026 17:061,72312,553,6954,308,0000524,288