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 listApr 28, 2026 08:36TudyMTudyMScore: 24,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:3724,63274,714,99755,525,0006,057,0002,306,048
2Apr 28, 2026 08:3724,64677,947,54557,575,0004,040,0002,375,680
3Apr 28, 2026 08:3724,65177,882,85759,608,0002,020,0002,400,256
4Apr 28, 2026 08:3724,65979,598,04659,627,0002,021,0002,301,952
5Apr 28, 2026 08:3724,72277,316,81656,823,0004,984,0002,306,048
6Apr 28, 2026 08:3724,72778,174,05657,831,0003,988,0002,363,392
7Apr 28, 2026 08:3724,74785,114,57156,879,0004,989,0002,297,856
8Apr 28, 2026 08:3724,76377,470,62056,917,0004,992,0002,318,336
9Apr 28, 2026 08:3724,76581,109,46756,920,0004,993,0002,297,856