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 14, 2026 18:41marko1597marko1597Score: 1,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:421,85513,030,9513,420,0001,218,0002,117,632
2Aug 14, 2026 18:421,86312,851,8153,412,0001,247,0002,117,632
3Aug 14, 2026 18:421,95013,566,0963,732,0001,143,0002,117,632
4Aug 14, 2026 18:421,96613,369,0403,767,0001,148,0002,117,632
5Aug 14, 2026 18:421,98114,110,7733,787,0001,166,0002,117,632
6Aug 14, 2026 18:421,98315,324,8623,817,0001,142,0002,117,632
7Aug 14, 2026 18:421,98813,335,4973,798,0001,174,0002,117,632
8Aug 14, 2026 18:422,00013,118,6193,863,0001,137,0002,117,632
9Aug 14, 2026 18:422,00213,307,5633,860,0001,146,0002,117,632