Unique strings Sergey Svistunov

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 listOct 12, 2025 03:29Marco BarboneMarco BarboneScore: 44,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 03:2944,6951,505,065,0611,461,943,00012,990,0002,437,120
2Oct 12, 2025 03:2944,6981,502,118,8111,456,045,00018,987,0002,326,528
3Oct 12, 2025 03:2944,7061,499,106,2891,455,322,00019,990,0002,322,432
4Oct 12, 2025 03:2944,8521,511,209,9141,462,118,00017,989,0002,330,624
5Oct 12, 2025 03:2944,9371,510,049,1531,468,922,00013,989,0002,330,624
6Oct 12, 2025 03:2945,0101,517,326,8351,468,335,00016,992,0002,416,640
7Oct 12, 2025 03:2945,7091,543,612,7131,493,437,00014,964,0002,535,424
8Oct 12, 2025 03:2945,9721,548,593,4261,504,090,00012,974,0002,277,376
9Oct 12, 2025 03:2945,9851,551,993,3271,505,540,00011,972,0002,326,528