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 15, 2026 05:44olliecrowolliecrowScore: 4,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 05:444,46926,769,8389,142,0002,031,0002,322,432
2Apr 15, 2026 05:444,47127,487,5179,146,0002,032,0002,363,392
3Apr 15, 2026 05:444,51028,379,9749,226,0002,050,0002,412,544
4Apr 15, 2026 05:444,56829,678,1328,306,0003,115,0002,490,368
5Apr 15, 2026 05:444,69831,819,17411,746,00002,375,680
6Apr 15, 2026 05:444,70230,497,43710,688,0001,068,0002,482,176
7Apr 15, 2026 05:444,77627,519,8018,955,0002,985,0002,400,256
8Apr 15, 2026 05:444,84729,880,7339,089,0003,029,0002,375,680
9Apr 15, 2026 05:444,88028,124,43810,168,0002,033,0002,486,272