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 26, 2026 20:25TudyMTudyMScore: 320,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 20:25320,694818,097,749798,738,0002,999,0002,547,712
2Apr 26, 2026 20:25320,732822,786,662798,833,0002,999,0002,547,712
3Apr 26, 2026 20:25320,780815,921,852800,951,000999,0002,547,712
4Apr 26, 2026 20:25320,831816,981,416800,078,0002,000,0002,547,712
5Apr 26, 2026 20:25320,888821,040,128800,222,0002,000,0002,338,816
6Apr 26, 2026 20:25320,909820,429,518800,274,0002,000,0002,543,616
7Apr 26, 2026 20:25320,952818,812,507800,383,0001,998,0002,551,808
8Apr 26, 2026 20:25320,970820,569,922799,429,0002,997,0002,551,808
9Apr 26, 2026 20:25321,171817,056,678800,930,0001,999,0002,547,712