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 13, 2026 08:42limanjun99limanjun99Score: 3,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 08:423,38829,243,5476,352,0002,117,0002,289,664
2Apr 13, 2026 08:423,39922,860,8045,311,0003,186,0002,387,968
3Apr 13, 2026 08:423,42626,128,3565,354,0003,212,0002,273,280
4Apr 13, 2026 08:423,43326,990,4446,437,0002,145,0002,289,664
5Apr 13, 2026 08:423,45224,813,2136,473,0002,157,0002,289,664
6Apr 13, 2026 08:423,47328,820,3006,512,0002,170,0002,306,048
7Apr 13, 2026 08:423,47424,666,8657,599,0001,085,0002,289,664
8Apr 13, 2026 08:423,49125,689,0857,637,0001,091,0002,535,424
9Apr 13, 2026 08:423,57027,720,4936,943,0001,983,0002,273,280