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:24Wookyung JeongWookyung JeongScore: 175,357Success
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:24173,9165,767,343,5815,687,257,00051,965,0002,347,008
2Sep 25, 2025 15:24175,0445,805,033,8485,729,467,00046,971,0002,310,144
3Sep 25, 2025 15:24175,1515,814,796,3065,730,017,00049,965,0002,416,640
4Sep 25, 2025 15:24175,2655,811,326,1445,730,796,00052,961,0002,498,560
5Sep 25, 2025 15:24175,3575,825,606,5125,739,807,00046,965,0002,523,136
6Sep 25, 2025 15:24176,2975,849,933,4015,770,831,00046,974,0002,506,752
7Sep 25, 2025 15:24177,0375,874,957,6495,807,238,00034,977,0002,445,312
8Sep 25, 2025 15:24178,2715,918,334,2365,835,971,00046,975,0002,453,504
9Sep 25, 2025 15:24178,3275,916,246,5565,834,812,00049,972,0002,453,504