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 14, 2026 17:11Josu San MartinJosu San MartinScore: 1,055,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 17:331,055,0322,646,353,6732,637,580,00002,113,536
2May 14, 2026 17:331,055,3602,647,359,7272,638,400,00002,113,536
3May 14, 2026 17:331,055,5302,647,245,0532,637,826,0001,001,0002,113,536
4May 14, 2026 17:331,055,5982,646,186,2742,637,958,0001,039,0002,113,536
5May 14, 2026 17:331,055,8412,646,939,5452,638,600,0001,003,0002,113,536
6May 14, 2026 17:331,056,0022,648,901,6752,640,006,00002,113,536
7May 14, 2026 17:331,056,3252,647,973,4592,639,793,0001,020,0002,113,536
8May 14, 2026 17:331,056,5642,648,538,0812,641,411,00002,113,536
9May 14, 2026 17:331,056,6932,650,566,5492,641,733,00002,113,536