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 15:55anboto1anboto1Error
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 15:560609,691,468597,174,0003,210,0002,113,536expected "1022132 ", got "1002663 "
2Jun 7, 2026 15:560604,482,608591,959,0003,160,0002,113,536expected "1022160 ", got "1002474 "
3Jun 7, 2026 15:560620,769,484608,271,0003,163,0002,113,536expected "1025152 ", got "1005487 "