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:32Josu San MartinJosu San MartinScore: 39,397Success
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:3239,1591,320,214,5641,128,355,000163,906,0002,428,928
2Jan 7, 2026 21:3239,3971,321,085,4871,126,227,000173,880,0002,314,240
3Jan 7, 2026 21:3239,4131,327,935,0551,132,816,000167,824,0002,510,848