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 listJun 7, 2026 21:10anboto1anboto1Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 21:130863,132,278847,523,0006,313,0002,113,536expected "1019193 ", got "1017412 "
2Jun 7, 2026 21:130866,529,729850,955,0006,239,0002,113,536expected "1023792 ", got "1022039 "
3Jun 7, 2026 21:130871,562,186855,836,0006,329,0002,113,536expected "1018733 ", got "1017042 "