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 1, 2026 03:44olliecrowolliecrowScore: 3,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 03:473,71829,724,5217,231,0002,066,0002,396,160
2May 1, 2026 03:473,72728,843,7267,248,0002,070,0002,338,816
3May 1, 2026 03:473,73922,430,4968,310,0001,038,0002,387,968
4May 1, 2026 03:473,75128,802,1437,294,0002,084,0002,404,352
5May 1, 2026 03:473,75425,078,8137,301,0002,086,0002,396,160
6May 1, 2026 03:473,79826,822,4808,440,0001,055,0002,392,064
7May 1, 2026 03:473,81629,939,2447,420,0002,120,0002,396,160
8May 1, 2026 03:473,99028,767,2625,985,0003,990,0002,396,160
9May 1, 2026 03:474,00229,125,6967,005,0003,002,0002,404,352