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 16:40Tomislav TunkovicTomislav TunkovicScore: 1,606Success
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 16:401,58812,314,3383,971,0000524,288
2Aug 15, 2026 16:401,59012,328,4533,977,0000524,288
3Aug 15, 2026 16:401,59112,346,8473,979,0000524,288
4Aug 15, 2026 16:401,59512,356,0623,988,0000524,288
5Aug 15, 2026 16:401,60612,476,3334,015,0000524,288
6Aug 15, 2026 16:401,66212,509,2392,985,0001,172,000524,288
7Aug 15, 2026 16:401,66412,506,5133,002,0001,160,000524,288
8Aug 15, 2026 16:401,68912,619,9734,224,0000524,288
9Aug 15, 2026 16:401,71112,555,3594,279,0000524,288