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 listJun 4, 2026 01:35Elijah KinElijah KinScore: 2,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 01:382,64617,301,3865,479,0001,136,0002,117,632
2Jun 4, 2026 01:382,65015,648,8405,482,0001,144,0002,117,632
3Jun 4, 2026 01:382,72415,926,6375,655,0001,157,0002,117,632
4Jun 4, 2026 01:382,73315,941,8345,663,0001,171,0002,117,632
5Jun 4, 2026 01:382,78316,456,6635,782,0001,176,0002,117,632
6Jun 4, 2026 01:382,79418,095,9895,835,0001,152,0002,117,632
7Jun 4, 2026 01:382,80418,123,2955,848,0001,163,0002,117,632
8Jun 4, 2026 01:382,86416,748,1715,985,0001,177,0002,117,632
9Jun 4, 2026 01:382,87216,725,7625,996,0001,184,0002,117,632