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 28, 2026 08:49TudyMTudyMScore: 22,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:5021,60569,542,88250,013,0004,001,0002,347,008
2Apr 28, 2026 08:5021,62075,319,39847,046,0007,006,0002,351,104
3Apr 28, 2026 08:5021,68073,711,97749,182,0005,018,0002,560,000
4Apr 28, 2026 08:5021,98570,590,34547,969,0006,995,0002,363,392
5Apr 28, 2026 08:5022,26270,449,77449,586,0006,071,0002,424,832
6Apr 28, 2026 08:5022,43873,102,76450,086,0006,010,0002,367,488
7Apr 28, 2026 08:5022,50575,830,74152,245,0004,018,0002,351,104
8Apr 28, 2026 08:5022,59674,378,19452,456,0004,035,0002,355,200
9Apr 28, 2026 08:5022,63877,434,44352,480,0004,116,0002,428,928