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 17, 2026 16:58Josu San MartinJosu San MartinScore: 17,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 16:524,449171,209,982145,829,000998,0002,392,064
2Jan 17, 2026 16:524,451171,306,275145,883,000999,0002,289,664
3Jan 17, 2026 16:524,451168,828,226143,889,0002,997,0002,289,664
4Jan 17, 2026 16:5217,253598,568,175565,361,0003,995,0002,400,256
5Jan 17, 2026 16:5217,290598,557,372564,575,0005,995,0002,260,992
6Jan 17, 2026 16:5217,349595,878,970569,515,0002,997,0002,314,240
7Jan 17, 2026 16:5817,405601,188,936567,361,0006,992,0002,461,696
8Jan 17, 2026 16:5817,469611,555,428567,471,0009,007,0002,289,664
9Jan 17, 2026 16:5817,520605,200,313575,151,0002,995,0002,326,528