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:38Marco BarboneMarco BarboneScore: 41,915Success
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:3841,6991,403,664,1121,361,063,00014,989,0002,535,424
2Oct 12, 2025 03:3841,7221,409,081,3141,360,853,00015,986,0002,502,656
3Oct 12, 2025 03:3841,8621,410,263,5631,367,473,00013,984,0002,273,280
4Oct 12, 2025 03:3841,8991,412,367,7921,368,679,00013,986,0002,408,448
5Oct 12, 2025 03:3841,9151,410,726,2961,365,215,00017,989,0002,322,432
6Oct 12, 2025 03:3841,9711,410,075,3891,369,052,00015,988,0002,412,544
7Oct 12, 2025 03:3842,0631,418,468,1851,377,091,00010,992,0002,334,720
8Oct 12, 2025 03:3842,3751,427,365,3261,383,411,00014,971,0002,301,952
9Oct 12, 2025 03:3842,5051,432,644,1651,384,721,00017,957,0002,330,624