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 listJan 10, 2026 14:20Pavel SkripkinPavel SkripkinScore: 62,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 14:2061,5612,061,110,8972,024,509,0006,994,0002,490,368
2Jan 10, 2026 14:2062,8612,100,611,9232,069,424,0004,996,0002,281,472
3Jan 10, 2026 14:2063,5082,127,696,4802,090,767,0004,997,0002,363,392