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 listSep 25, 2025 15:48Wookyung JeongWookyung JeongScore: 168,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 15:48166,9945,539,559,4005,463,828,00046,972,0002,461,696
2Sep 25, 2025 15:46167,2075,548,385,5925,480,866,00036,978,0002,400,256
3Sep 25, 2025 15:46167,2665,548,059,3355,475,801,00043,974,0002,416,640
4Sep 25, 2025 15:46168,0165,571,921,8035,479,581,00064,959,0002,506,752
5Sep 25, 2025 15:48168,6075,593,172,7825,521,074,00042,969,0002,326,528
6Sep 25, 2025 15:48169,6075,630,498,5835,538,058,00058,968,0002,322,432