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 13:39Josu San MartinJosu San MartinScore: 4,657Success
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 13:354,652185,195,045153,514,00002,400,256
2Jan 10, 2026 13:354,656183,576,473152,667,000997,0002,404,352
3Jan 10, 2026 13:394,657179,422,167152,686,000997,0002,293,760
4Jan 10, 2026 13:394,657175,661,908152,695,000998,0002,293,760
5Jan 10, 2026 13:394,658179,194,725152,723,000998,0002,293,760
6Jan 10, 2026 13:354,768180,273,361156,347,0001,002,0002,400,256