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 23, 2026 19:01olliecrowolliecrowScore: 4,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 19:054,81632,501,70510,035,0002,007,0002,543,616
2Apr 23, 2026 19:054,83528,250,9078,059,0004,029,0002,535,424
3Apr 23, 2026 19:054,84130,399,3487,060,0005,043,0002,539,520
4Apr 23, 2026 19:054,84229,793,2259,079,0003,026,0002,547,712
5Apr 23, 2026 19:054,85229,384,6467,076,0005,054,0002,539,520
6Apr 23, 2026 19:054,87933,368,5928,132,0004,066,0002,498,560
7Apr 23, 2026 19:054,88230,238,4267,120,0005,086,0002,363,392
8Apr 23, 2026 19:055,05228,825,9609,474,0003,158,0002,555,904
9Apr 23, 2026 19:055,35939,346,54610,307,0003,092,0002,547,712