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 listJul 30, 2026 21:43Andrew TsibinAndrew TsibinScore: 2,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 21:441,97114,987,2713,690,0001,238,0002,117,632
2Jul 30, 2026 21:441,99414,937,3283,753,0001,234,0002,117,632
3Jul 30, 2026 21:441,99914,978,4783,756,0001,242,0002,117,632
4Jul 30, 2026 21:442,00415,009,1283,757,0001,253,0002,117,632
5Jul 30, 2026 21:442,01015,140,2893,761,0001,264,0002,117,632
6Jul 30, 2026 21:442,07615,121,5723,872,0001,320,0002,117,632
7Jul 30, 2026 21:442,09015,473,1773,900,0001,326,0002,117,632
8Jul 30, 2026 21:442,09215,151,2324,034,0001,198,0002,117,632
9Jul 30, 2026 21:442,11315,231,9573,946,0001,337,0002,117,632