Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listApr 27, 2026 22:55TudyMTudyMScore: 11,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 23:0511,224336,741,143908,404,00031,013,0002,646,016
2Apr 27, 2026 23:0511,299338,984,957913,230,00030,973,0002,560,000
3Apr 27, 2026 23:0511,325339,756,265910,369,00029,011,0002,772,992
4Apr 27, 2026 23:0511,330339,907,975926,078,00027,002,0002,678,784
5Apr 27, 2026 23:0511,556346,701,424945,189,00030,973,0002,674,688
6Apr 27, 2026 23:0511,670350,110,743943,291,00033,974,0002,932,736
7Apr 27, 2026 23:0511,727351,818,027941,688,00033,988,0002,592,768
8Apr 27, 2026 23:0511,734352,047,292947,249,00028,977,0002,510,848
9Apr 27, 2026 23:0511,749352,499,943944,006,00025,972,0002,830,336