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 22, 2026 21:15olliecrowolliecrowScore: 4,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 21:174,39326,888,6847,988,0002,995,0002,400,256
2Apr 22, 2026 21:174,40531,401,4889,011,0002,002,0002,392,064
3Apr 22, 2026 21:174,41832,240,7458,033,0003,012,0002,392,064
4Apr 22, 2026 21:174,41835,124,2698,034,0003,012,0002,396,160
5Apr 22, 2026 21:174,44727,787,4229,097,0002,021,0002,392,064
6Apr 22, 2026 21:174,50229,136,0718,186,0003,070,0002,453,504
7Apr 22, 2026 21:174,51428,985,7599,234,0002,052,0002,347,008
8Apr 22, 2026 21:174,51630,374,4858,213,0003,079,0002,400,256
9Apr 22, 2026 21:174,70627,781,5549,627,0002,139,0002,359,296