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 listMay 19, 2026 14:42Elijah KinElijah KinScore: 14,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:4314,67448,696,77933,490,0003,196,0002,113,536
2May 19, 2026 14:4314,68846,861,68033,530,0003,191,0002,113,536
3May 19, 2026 14:4314,73149,243,35733,743,0003,086,0002,113,536
4May 19, 2026 14:4314,78547,907,08733,819,0003,144,0002,113,536
5May 19, 2026 14:4314,79146,879,89933,820,0003,158,0002,113,536
6May 19, 2026 14:4314,83549,081,04933,875,0003,213,0002,113,536
7May 19, 2026 14:4314,90849,344,79934,041,0003,231,0002,113,536
8May 19, 2026 14:4315,04749,890,40634,264,0003,354,0002,113,536
9May 19, 2026 14:4315,06649,939,33934,447,0003,218,0002,113,536