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 listApr 23, 2026 05:07Charles CabergsCharles CabergsScore: 8,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 05:077,99841,959,83713,997,0005,998,0002,334,720
2Apr 23, 2026 05:078,00039,312,26515,002,0005,000,0002,359,296
3Apr 23, 2026 05:078,04240,716,46313,068,0007,037,0002,342,912
4Apr 23, 2026 05:078,05136,294,67015,096,0005,032,0002,334,720
5Apr 23, 2026 05:078,06639,157,55315,125,0005,041,0002,334,720
6Apr 23, 2026 05:078,09037,125,57912,136,0008,091,0002,400,256
7Apr 23, 2026 05:078,10130,653,65616,203,0004,050,0002,318,336
8Apr 23, 2026 05:078,21237,797,57114,372,0006,159,0002,322,432
9Apr 23, 2026 05:078,28838,234,66316,578,0004,144,0002,330,624