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 8, 2026 19:39Павел РатмановПавел РатмановScore: 47,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 19:3946,3141,557,382,8261,514,374,00013,994,0002,330,624
2Jan 8, 2026 19:3947,1351,583,139,3171,545,459,0009,990,0002,416,640
3Jan 8, 2026 19:3948,2941,621,946,9041,583,705,0009,998,0002,490,368