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 listAug 15, 2026 22:08marko1597marko1597Score: 1,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:191,75812,856,9413,171,0001,224,0002,117,632
2Aug 15, 2026 22:191,75812,752,1883,173,0001,223,0002,117,632
3Aug 15, 2026 22:191,79312,957,0073,201,0001,282,0002,117,632
4Aug 15, 2026 22:191,82712,888,5403,250,0001,319,0002,117,632
5Aug 15, 2026 22:191,88813,820,7593,433,0001,289,0002,117,632
6Aug 15, 2026 22:191,89613,881,0383,592,0001,150,0002,117,632
7Aug 15, 2026 22:191,90413,298,8003,593,0001,167,0002,117,632
8Aug 15, 2026 22:191,91013,001,1403,611,0001,166,0002,117,632
9Aug 15, 2026 22:191,93014,022,5123,546,0001,280,0002,117,632