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 listMar 4, 2026 18:38olliecrowolliecrowScore: 18,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 18:3818,35271,450,93441,890,0003,989,0002,404,352
2Mar 4, 2026 18:3818,35571,659,21842,896,0002,992,0002,404,352
3Mar 4, 2026 18:3818,41277,165,41240,027,0006,004,0002,400,256
4Mar 4, 2026 18:3818,42170,750,20843,049,0003,003,0002,408,448
5Mar 4, 2026 18:3818,47170,839,63339,150,0007,027,0002,396,160
6Mar 4, 2026 18:3818,49169,015,35340,199,0006,029,0002,396,160
7Mar 4, 2026 18:3818,54871,290,21143,345,0003,024,0002,441,216
8Mar 4, 2026 18:3818,57674,484,26539,373,0007,067,0002,449,408
9Mar 4, 2026 18:3818,59471,635,61141,432,0005,052,0002,408,448