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 5, 2026 00:13olliecrowolliecrowScore: 4,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 00:264,06529,137,2467,748,0002,415,0002,400,256
2May 5, 2026 00:264,09527,983,0877,765,0002,474,0002,408,448
3May 5, 2026 00:264,13824,612,0557,788,0002,559,0002,396,160
4May 5, 2026 00:264,15529,325,7477,801,0002,587,0002,387,968
5May 5, 2026 00:264,15727,838,3627,806,0002,588,0002,396,160
6May 5, 2026 00:264,16127,789,5687,819,0002,584,0002,387,968
7May 5, 2026 00:264,17826,571,7207,813,0002,634,0002,400,256
8May 5, 2026 00:264,18527,256,6737,783,0002,680,0002,383,872
9May 5, 2026 00:264,19329,207,5437,821,0002,662,0002,392,064