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 7, 2026 21:29Josu San MartinJosu San MartinScore: 58,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 21:2957,7881,931,245,5851,750,074,000156,917,0002,285,568
2Jan 7, 2026 21:2958,1031,942,971,7011,765,512,000151,872,0002,445,312
3Jan 7, 2026 21:2958,9551,970,926,9271,781,631,000163,874,0002,490,368