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 29, 2026 21:37olliecrowolliecrowScore: 4,129Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 21:394,00624,470,8487,012,0003,005,0002,408,448
2Apr 29, 2026 21:394,03128,007,5917,055,0003,023,0002,396,160
3Apr 29, 2026 21:394,06628,074,9297,116,0003,050,0002,400,256
4Apr 29, 2026 21:394,09427,633,3477,166,0003,071,0002,392,064
5Apr 29, 2026 21:394,12932,072,6928,259,0002,064,0002,400,256
6Apr 29, 2026 21:394,14625,209,4848,294,0002,073,0002,396,160
7Apr 29, 2026 21:394,16428,541,4417,287,0003,123,0002,404,352
8Apr 29, 2026 21:394,23826,194,5929,537,0001,059,0002,404,352
9Apr 29, 2026 21:394,47226,983,0178,131,0003,049,0002,400,256