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 listMay 17, 2026 10:14M-RochatM-RochatScore: 4,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 10:144,33221,925,4829,768,0001,064,0002,117,632
2May 17, 2026 10:144,39219,672,5679,908,0001,074,0002,121,728
3May 17, 2026 10:144,39519,600,3379,918,0001,071,0002,113,536
4May 17, 2026 10:144,41819,633,1279,975,0001,070,0002,121,728
5May 17, 2026 10:144,41919,744,4829,978,0001,071,0002,117,632
6May 17, 2026 10:144,42919,590,65310,000,0001,073,0002,121,728
7May 17, 2026 10:144,43119,545,04410,002,0001,076,0002,117,632
8May 17, 2026 10:144,43419,595,00910,007,0001,078,0002,121,728
9May 17, 2026 10:144,43519,757,75110,015,0001,074,0002,121,728