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 listOct 23, 2026 09:46Stefan Antoniu OpreaStefan Antoniu OpreaScore: 192,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2026 09:46192,2286,355,137,0976,293,695,00049,852,0002,113,536
2Oct 23, 2026 09:46192,5366,364,737,2136,295,946,00057,762,0002,113,536
3Oct 23, 2026 09:46193,7246,404,526,7766,343,595,00049,319,0002,113,536