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 listJul 30, 2026 20:40CodeReclaimersCodeReclaimersScore: 13,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 20:4113,237446,908,528417,505,00019,342,0002,113,536
2Jul 30, 2026 20:4113,265447,808,860419,192,00018,581,0002,113,536
3Jul 30, 2026 20:4113,366451,759,138421,593,00019,515,0002,113,536
4Jul 30, 2026 20:4113,374451,998,288421,769,00019,573,0002,113,536
5Jul 30, 2026 20:4113,385451,815,417422,361,00019,369,0002,113,536
6Jul 30, 2026 20:4113,455454,080,018424,485,00019,538,0002,113,536
7Jul 30, 2026 20:4113,467455,174,517424,989,00019,454,0002,113,536
8Jul 30, 2026 20:4114,137476,679,665447,055,00019,469,0002,113,536
9Jul 30, 2026 20:4114,530489,717,470459,472,00020,032,0002,113,536